In *Second-Order Cone Problems* (SOCP), a linear function is
minimized over the intersection of an affine set and the product of
second-order (quadratic) cones [153,22]. Nonlinear,
convex problem including linear and (convex) quadratic programs are
special cases. SOCP problems are solved by efficient primal-dual
interior-point methods. The number of iterations required to solve a
problem grows at most as the *square root* of the problem size.
A typical number of iterations ranges between 5 and 50, almost
independent of the problem size.

[How to cite this work] [Order a printed hardcopy] [Comment on this page via email]

[Lecture Video] [Exercises] [Examination]

Copyright ©

Center for Computer Research in Music and Acoustics (CCRMA), Stanford University