Jump to content

Second-order cone programming

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Rsandvik (talk | contribs) at 12:53, 18 October 2006. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

A second order cone programing problem (SOCP) can be seen as a generalization of linear optimization. Simply put, a conic optimization problem is a linear optimization problem plus a constraint of the form where is a second order cone. Two types of second order cones are:

  • Quadratic cone of dimension  :
  • Rotated quadratic cone of dimension  :

Solvers for SOCP