Second-order cone programming

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

:minimize $\ f^T x \$
:subject to
::$\lVert A_i x + b_i \rVert_2 \leq c_i^T x + d_i,\quad i = 1,\dots,m$
::$Fx = g \$

where the problem parameters are $f \in \mathbb^n, \ A_i \in \mathbb^, \ b_i \in \mathbb^, \ c_i \in \mathbb^n, \ d_i \in \mathbb, \ F \in \mathbb^$, and $g \in \mathbb^p$. $x\in\mathbb^n$ is the optimization variable.
$\lVert x \rVert_2$ is the Euclidean norm and $^T$ indicates transpose. The "second-order cone" in SOCP arises from the constraints, which are equivalent to requiring the affine function $(A x + b, c^T x + d)$ to lie in the second-order cone in $\mathbb^$.

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 cone

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

$\mathcal_=\left\$.

The second-order cone is also known by quadratic cone or ice-cream cone or Lorentz cone. The standard second-order cone in $\mathbb^3$ is $\left\$.

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

$\lVert A_i x + b_i \rVert_2 \leq c_i^T x + d_i \Leftrightarrow \begin A_i \\ c_i^T \end x + \begin b_i \\ d_i \end \in \mathcal_$

and hence is convex.

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

$, , x, , \leq t \Leftrightarrow \begin tI & x \\ x^T & t \end \succcurlyeq 0,$

i.e., a second-order cone constraint is equivalent to a linear matrix inequality (Here $M\succcurlyeq 0$ means $M$ is semidefinite matrix). Similarly, we also have,

$\lVert A_i x + b_i \rVert_2 \leq c_i^T x + d_i \Leftrightarrow \begin (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 \succcurlyeq 0$.

Relation with other optimization problems

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 A x + b^T x + c \leq 0.$

This is equivalent to the SOCP constraint

:$\lVert A^ x + \fracA^b \rVert \leq \left(\fracb^T A^ b - c \right)^$

Stochastic linear programming

Consider a stochastic linear program in inequality form

:minimize $\ c^T x \$
:subject to
::$\mathbb(a_i^Tx \leq b_i) \geq p, \quad i = 1,\dots,m$

where the parameters $a_i \$ are independent Gaussian random vectors with mean $\bar_i$ and covariance $\Sigma_i \$ and $p\geq0.5$. This problem can be expressed as the SOCP

:minimize $\ c^T x \$
:subject to
:: $\bar_i^T x + \Phi^(p) \lVert \Sigma_i^ x \rVert_2 \leq b_i , \quad i = 1,\dots,m$

where $\Phi^(\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

See also

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

References

{{reflist

Optimization algorithms and methods
Convex optimization