您要查找的是不是：
- A Weaker Condition of Combined Homotopy Interior Point Me thod for Solving Nonlinear Convex Programming 解非线性凸规划问题的组合同伦法的较弱条件
- nonlinear convex programming 非线性凸规划
- Finally, optimality necessary and sufficient conditions for nonlinear convex semidefinite programming are proved. 并给出了非线性半定规划的最优性必要和充分条件.
- For a class of nonlinear bi-level programming whose follower-level problems are differentiable convex programming, a novel algorithm is proposed. 摘要针对下层为可微凸规划的非线性双层规划，提出了一种新算法。
- nonlinear convex semidefinite programming 非线性凸半定规划
- An on-line training algorithm is presented to avoid repetitious solving the convex programming problem. 并给出一种?着调整时的在线训练算法，避免重复求解凸规划问题。
- The key idea of SSVM is to transform the standard model of SVM into an unconstraint quadric convex programming problem. SSVM模型的基本思想是将标准的支撑向量机模型转化成一个无约束二次凸规划模型进行求解。
- The solution is a uniquely solvable convex program which computes correspondence simultaneously for all images . 这是一个计算所有图像相关性的，唯一的，可解的凸规划问题。
- Abstract: This paper presents a new primal?dual interior point algorithm for a convex programming with box constraints, and prove the iteration complexity is polynomial. 文摘:本文为框式约束的一类凸规划提出了一个新的内点算法，原始-对偶路径跟踪法，并证明了算法的迭代复杂性为多项式时间性.
- Moreover, an approach is obtainedtodesigncontrollervia convex programming algorithm such that the closed loop system is ESPR and has maximum perturbation bound under the method. 通过凸优化算法,得到了所提出方法意义下具有最大摄动界的ESPR控制器设计方法。
- conditions for nonlinear convex semidefinite programming are proved. 并给出了非线性半定规划的最优性必要和充分条件.
- 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 Union of Dual Forms of the Convex Programming 凸规划对偶的统一性
- A bilevel convex progamming that is equivalent to the minimum risk bilevel programing is given,An approximate decomposition algorithm for solving this bilevel convex programming problem is proposed. 给出了具有极小风险解的二层规划的等价二层规划,并提出了求解这类二层凸规划的一个近似分解算法。
- multi-objective convex programming 多目标凸规划
- quadratic integer convex programming 凸二次整数极小化
- reverse convex programming problem 反凸规划
- Isotonic regression by convex program 凸规划下的保序回归
- A convex surface, body, part, or line. 凸面、凸面体、凸面部分或凸线
- In computer programming, a jump instruction. 计算机程序设计中的一种跳转指令。建议使用jump。
