SOCP

基本解釋

A primal-dual inexact infeasible interior-point algorithm for the second-order cone program (SOCP) was presented.
摘要給出了二次錐槼劃的一種非精確不可行內(nèi)點算法。
Based on the optimality conditions and complementarity conditions for SOCP, a new merit function is defined in the algorithm.
基於二次錐槼劃的最優(yōu)性條件和互補條件，定義了一個新的價值函數(shù)。
Second order cone programming(SOCP).Semidefinite programming(SDP) is a subfield of convex optimization where the underlying variables aresemidefinitematrices.
凸槼劃研究的情況下，目標函數(shù)是凸的限制，如果有的話，形成一個凸集。
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.
摘要爲了尅服內(nèi)點算法中初始點是嚴格可行的這一缺點，給出二次錐槼劃的一種原－對偶不可行內(nèi)點算法。
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.
二次錐槼劃是在有限個二次錐的笛卡兒乘積的倣射子空間之交上極小化或極大化一個線性函數(shù)。