Second-order cone programming: Difference between revisions

Revision as of 13:38, 26 October 2006

Revision as of 13:38, 26 October 2006

Line 8:

* Rotated quadratic cone of dimension <math> t </math> : <math> \mathcal{C}_t = \left \{ x \in \real^{n^t}: 2 x_1 x_2 \geq \sum\limits_{j=3}^{n^t} x_j^2,~ x_1,x_2 \geq 0 \right \} </math>

Several software packages exists for solving SOCP problems, such as [[MOSEK]] and [[SeDiMi]] exists.

[[Category:Optimization]]