The State-of-the-Art in Conic Optimization Software

Hans D. Mittelmann ()
Additional contact information
Hans D. Mittelmann: Arizona State University

Chapter Chapter 23 in Handbook on Semidefinite, Conic and Polynomial Optimization, 2012, pp 671-686 from Springer

Abstract: Abstract This work gives an overview of the major codes available for the solution of linear semidefinite (SDP) and second-order cone (SOCP) programs. Many of these codes also solve linear programs (LP). Some developments since the 7th DIMACS Challenge [10, 18] are pointed out as well as some currently under way. Instead of presenting performance tables, reference is made to the ongoing benchmark webpage [20] as well as other related efforts.

Keywords: Cholesky Factorization; Input Format; Quadratic Cone; Approximate Optimal Solution; Augmented Lagrangian Algorithm (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-1-4614-0769-0_23

Ordering information: This item can be ordered from
http://www.springer.com/9781461407690

DOI: 10.1007/978-1-4614-0769-0_23

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().