Semidefinite programming: Difference between revisions

Content deleted Content added
Citation bot (talk | contribs)
Alter: template type, url. URLs might have been anonymized. Add: hdl, eprint, class, arxiv, s2cid, isbn, pages, year, title, chapter, doi, chapter-url, authors 1-1. Removed or converted URL. Changed bare reference to CS1/2. Removed parameters. Formatted dashes. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Headbomb | #UCB_toolbar
Jfessler (talk | contribs)
m fix Burer - Montero author order
Line 231:
 
=== Other solving methods ===
Algorithms based on [[Augmented Lagrangian method]] (PENSDP) are similar in behavior to the interior point methods and can be specialized to some very large scale problems. Other algorithms use low-rank information and reformulation of the SDP as a [[nonlinear programming]] problem (SDPLR).<ref>{{citation|last1last2=Monteiro|first1first2=Renato D. C.|last2last1=Burer|first2first1=Samuel|date=2003|title=A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization|journal=Mathematical Programming|language=en|volume=95|issue=2|pages=329–357|doi=10.1007/s10107-002-0352-8|issn=1436-4646|citeseerx=10.1.1.682.1520|s2cid=7691228}}</ref>
 
=== Approximate methods ===