SOCP

基本解釋

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