Revision as of 07:58, 2 November 2008 edit Appoose (talk \| contribs) 231 edits mention of SOCP can be written as a special case of SDP ← Previous edit		Revision as of 07:59, 2 November 2008 edit undo Appoose (talk \| contribs) 231 edits →Solvers Next edit →
Line 40: * [http://www.princeton.edu/~rvdb/ LOQO] Note that the most of the solvers in the above list are more general solvers (i.e they solve [[Semidefinite programming\| Semidefinite Programs]] or more general [[Convex optimization]] problems). There have been a few benchmarking studies comparing the various solvers <ref>{{cite journal \|title = An independent benchmarking of SDP and SOCP solvers \|author = H.D Mittelmann

Second-order cone programming: Difference between revisions