SOCP

常见例句

A primal-dual inexact infeasible interior-point algorithm for the second-order cone program (SOCP) was presented.
摘要给出了二次锥规划的一种非精确不可行内点算法。
Based on the optimality conditions and complementarity conditions for SOCP, a new merit function is defined in the algorithm.
基于二次锥规划的最优性条件和互补条件，定义了一个新的价值函数。
Second order cone programming(SOCP).Semidefinite programming(SDP) is a subfield of convex optimization where the underlying variables aresemidefinitematrices.
凸规划研究的情况下，目标函数是凸的限制，如果有的话，形成一个凸集。
In order to overcome the deficiency that initial points should be strictly feasible in interior point methods, a primal-dual infeasible-interior-point algorithm for the second-order cone programming (SOCP) is presented.
摘要为了克服内点算法中初始点是严格可行的这一缺点，给出二次锥规划的一种原－对偶不可行内点算法。
The second-order cone programming (SOCP) problem is to minimize or maximize a linear function over the intersection of an affine space with the Cartesian product of a finite number of second-order cones.
二次锥规划是在有限个二次锥的笛卡儿乘积的仿射子空间之交上极小化或极大化一个线性函数。
SOCP Sub-Spaces Model of EOD and its Implementation
教学点播(EOD)的SOCP子空间模型与实现