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.

• 二次锥规划是在有限个二次锥的笛卡儿乘积的仿射子空间之交上极小化或极大化一个线性函数。