convex programming meaning in English
凸规划
凸形规划法
Examples
- Abstract firstly , convert a programming problem with multiple constraints into a programming problem with single constraint , secondly , several convexification and concavification transformations for the constrained problem with strictly monotone constraint functions are proposed according to the transformed problem with single constraint , then this constrained programming problem can be converted into a concave minimization or a reverse convex programming problem
摘要首先将一个具有多个约束的规划问题转化为一个只有一个约束的规划问题，然后通过利用这个单约束的规划问题，对原来的多约束规划问题提出了一些凸化、凹化的方法，这样这些多约束的规划问题可以被转化为一些凹规划、反凸规划同题。 - Based on lyapunov stability theory , razumikhin stability theory and convex set theory , also by using linear matrix inequality , matrix analyzing methods and convex programming methods , we studied some kinds of robust control problem for uncertain time delay systems in details
本论文主要基于lyapunov稳定性定理、 razumikhin稳定性定理以及凸集的有关理论，并采用线性矩阵不等式、矩阵分析以及凸规划等工具研究用状态空间模型描述的不确定时滞系统的鲁棒控制问题。