Second-order cone programming

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

minimize ${\displaystyle \ f^{T}x\ }$ subject to

${\displaystyle \lVert A_{i}x+b_{i}\rVert _{2}\leq c_{i}^{T}x+d_{i},\quad i=1,\dots ,m}$

${\displaystyle Fx=g\ }$

where the problem parameters are ${\displaystyle f\in \mathbb {R} ^{n},\ A_{i}\in \mathbb {R} ^{{n_{i}}\times n},\ b_{i}\in \mathbb {R} ^{n_{I}},\ c_{i}\in \mathbb {R} ^{n},\ d_{i}\in \mathbb {R} ,\ F\in \mathbb {R} ^{p\times n}}$, and ${\displaystyle g\in \mathbb {R} ^{p}}$. Here ${\displaystyle x\in \mathbb {R} ^{n}}$ is the optimization variable. When ${\displaystyle A_{i}=0}$ for ${\displaystyle i=1,\dots ,m}$, the SOCP reduces to a linear program. When ${\displaystyle c_{i}=0}$ for ${\displaystyle i=1,\dots ,m}$, the SOCP is equivalent to a convex Quadratically constrained quadratic program.