convex programming 凸规划 ; 凸形规划法
separable convex programming 可分离凸规划
convex quadratic programming [数] 凸二次规划 ; 凸二次式规画
non-convex quadratic programming 非凸二次规划
canonical convex programming 标准凸规则 ; 标准凸规划
generalized convex programming 广义凸规划
sequential convex programming 和序列凸规划法 ; 用序列凸规划 ; 法
convex programming model 凸规划模型
convex programming Problem 凸性规划问题 ; 中凸性规划问题
The paper offers a dual problem for the semi-infinite convex programming by using the directional derivative with zero dual gap.
本文对半无限凸规划提出一个用方向导数表述的对偶问题，其对偶间隙为零。
In convex programming theory, a constrained optimization problem, by KT conditions, is usually converted into a mixed nonlinear complementarity problem.
在凸规划理论中，通过KT条件，往往将约束最优化问题归结为一个混合互补问题来求解。
This paper deals with the nonlinear equations algorithm for convex nonlinear programming problems with equality constraints.
对等式约束的凸非线性规划问题的非线性方程组算法进行了研究。
应用推荐