convex optimization problem的意思|示意
凸优化问题
convex optimization problem的网络常见释义
凸优化问题 L1范数优化是与L0范数优化最接近的凸优化问题（convex optimization problem），并且相关研究发现，当得到的表示足够稀疏时，L0范数与L1等价。
convex optimization problem相关短语
1、 highly non-convex optimization problem 高度非凸的优化问题
2、 Generalized convex optimization problem 广义凸优化问题
convex optimization problem相关例句
Furthermore, a convex optimization problem with LMI constraints is formulated to design the optimal guaranteed cost controllers.
通过求解一个线性矩阵不等式约束的凸优化问题，提出了最优化保性能控制律的设计方法。
Reliability index Robust Convex model Optimization problem;
可靠性指标； 稳健； 凸模型； 优化问题；
The optimization problem can be solved based on the density-stiffness interpolation scheme and the method of moving asymptotes belonging to sequential convex programming approaches.
采用基于密度刚度插值模型和序列凸规划法中的移动渐近线方法求解优化模型。 通过经典算例验证了本方法的有效性。
The problem is reduced to a linear convex optimization algorithm via LMI approach.
采用线性矩阵不等式方法，将问题转化为一个线性凸优化算法。
The problem of resource allocation in this scheme is a non-convex non-linear optimization problem.
该模型中的资源分配问题是一个非凸的非线性优化问题。
Using the linear matrix inequality (LMI) technique, the problem is converted into a linear convex optimization algorithm so that a global optimization solution is obtained. Finally.
采用线性矩阵不等式技术，将问题转化为一线性凸优化算法，可得问题的全局最优解。