Second-order cone programming

A second-order cone program (SOCP) is a convex optimization problem of the form

minimize $f^{T}x$

subject to

$\Vert A_{i}x+b_i{\Vert }_2\le c_i^{T}x+d_i,i=1,\dots ,m$

$Fx=g$

where the problem parameters are $f\in {ℝ}^n,A_i\in {ℝ}^{n_i\times n},b_i\in {ℝ}^{n_i},c_i\in {ℝ}^n,d_i\in ℝ,F\in {ℝ}^{p\times n}$, and $g\in {ℝ}^p$. $x\in {ℝ}^n$ is the optimization variable. $\Vert x{\Vert }_2$ is the Euclidean norm and ${}^T$ indicates transpose.

The name "second-order cone programming" comes from the nature of the individual constraints, which are each of the form:

$\Vert Ax+b{\Vert }_2\le c^{T}x+d$

These each define a subspace that is bounded by an inequality based on a second-order polynomial function defined on the optimization variable $x$; this can be shown to define a convex cone, hence the name "second-order cone". By the definition of convex cones, their intersection can also be shown to be a convex cone, although not necessarily one that can be defined by a single second-order inequality. See below for a more detailed treatment.

SOCPs can be solved by interior point methods and in general, can be solved more efficiently than semidefinite programming (SDP) problems. Some engineering applications of SOCP include filter design, antenna array weight design, truss design, and grasping force optimization in robotics. Applications in quantitative finance include portfolio optimization; some market impact constraints, because they are not linear, cannot be solved by quadratic programming but can be formulated as SOCP problems.

Second-order cones

The standard or unit second-order cone of dimension $n+1$ is defined as

${𝒞}_{n+1}=\left\{\left[\begin{array}{c}x\\ t\end{array}\right]\right|x\in {ℝ}^n,t\in ℝ,\Vert x{\Vert }_2\le t\}$.

The second-order cone is also known by the names quadratic cone or ice-cream cone or Lorentz cone. For example, the standard second-order cone in ${ℝ}^3$ is

$\{(x,y,z)|\sqrt{x^2+y^2}\le z\}$.

The set of points satisfying a second-order cone constraint is the inverse image of the unit second-order cone under an affine mapping:

$\Vert A_{i}x+b_i{\Vert }_2\le c_i^{T}x+d_i\iff \left[\begin{array}{c}{A}_i\\ c_i^T\end{array}\right]x+\left[\begin{array}{c}{b}_i\\ d_i\end{array}\right]\in {𝒞}_{n_i+1}$

and hence is convex.

The second-order cone can be embedded in the cone of the positive semidefinite matrices since

$||x||\le t\iff \left[\begin{array}{cc}tI& x\\ x^T& t\end{array}\right]\succcurlyeq 0,$

i.e., a second-order cone constraint is equivalent to a linear matrix inequality. The nomenclature here can be confusing; here $M\succcurlyeq 0$ means $M$ is a semidefinite matrix: that is to say

$x^{T}Mx\ge 0\text{ for all }x\in {ℝ}^n$

which is not a linear inequality in the conventional sense.

Similarly, we also have,

$\Vert A_{i}x+b_i{\Vert }_2\le c_i^{T}x+d_i\iff \left[\begin{array}{cc}(c_i^{T}x+d_i)I& A_{i}x+b_i\\ (A_{i}x+b_i{)}^T& c_i^{T}x+d_i\end{array}\right]\succcurlyeq 0$.

Relation with other optimization problems

File:Hierarchy compact convex.png

A hierarchy of convex optimization problems. (LP: linear program, QP: quadratic program, SOCP second-order cone program, SDP: semidefinite program, CP: cone program.)

When $A_i=0$ for $i=1,\dots ,m$, the SOCP reduces to a linear program. When $c_i=0$ for $i=1,\dots ,m$, the SOCP is equivalent to a convex quadratically constrained linear program.

Convex quadratically constrained quadratic programs can also be formulated as SOCPs by reformulating the objective function as a constraint. Semidefinite programming subsumes SOCPs as the SOCP constraints can be written as linear matrix inequalities (LMI) and can be reformulated as an instance of semidefinite program. The converse, however, is not valid: there are positive semidefinite cones that do not admit any second-order cone representation.

Any closed convex semialgebraic set in the plane can be written as a feasible region of a SOCP,. However, it is known that there exist convex semialgebraic sets of higher dimension that are not representable by SDPs; that is, there exist convex semialgebraic sets that can not be written as the feasible region of a SDP (nor, a fortiori, as the feasible region of a SOCP).

Examples

Quadratic constraint

Consider a convex quadratic constraint of the form

$x^{T}Ax+b^{T}x+c\le 0.$

This is equivalent to the SOCP constraint

$\Vert A^{1/2}x+\frac{1}{2}{A}^{-1/2}b\Vert \le {(\frac{1}{4}{b}^T{A}^{-1}b-c)}^{\frac{1}{2}}$

Stochastic linear programming

Consider a stochastic linear program in inequality form

minimize $c^{T}x$

subject to

$\mathbb{P}(a_i^{T}x\le b_i)\ge p,i=1,\dots ,m$

where the parameters $a_i$ are independent Gaussian random vectors with mean ${\overline{a}}_i$ and covariance ${\Sigma }_i$ and $p\ge 0.5$. This problem can be expressed as the SOCP

minimize $c^{T}x$

subject to

${\overline{a}}_i^{T}x+{\Phi }^{-1}(p)\Vert {\Sigma }_i^{1/2}x{\Vert }_2\le b_i,i=1,\dots ,m$

where ${\Phi }^{-1}(\cdot )$ is the inverse normal cumulative distribution function.

Stochastic second-order cone programming

We refer to second-order cone programs as deterministic second-order cone programs since data defining them are deterministic. Stochastic second-order cone programs are a class of optimization problems that are defined to handle uncertainty in data defining deterministic second-order cone programs.

Other examples

Other modeling examples are available at the MOSEK modeling cookbook.

Solvers and scripting (programming) languages

Name	License	Brief info
ALGLIB	free/commercial	A dual-licensed C++/C#/Java/Python numerical analysis library with parallel SOCP solver.
AMPL	commercial	An algebraic modeling language with SOCP support
Artelys Knitro	commercial
CPLEX	commercial
FICO Xpress	commercial
Gurobi Optimizer	commercial
MATLAB	commercial	The coneprog function solves SOCP problems using an interior-point algorithm
MOSEK	commercial	parallel interior-point algorithm
NAG Numerical Library	commercial	General purpose numerical library with SOCP solver

See also

• Power cones are generalizations of quadratic cones to powers other than 2.