zbMATH — the first resource for mathematics

Latest developments in the SDPA family for solving large-scale SDPs. (English) Zbl 1334.90119
Anjos, Miguel F. (ed.) et al., Handbook on semidefinite, conic and polynomial optimization. New York, NY: Springer (ISBN 978-1-4614-0768-3/hbk; 978-1-4614-0769-0/ebook). International Series in Operations Research & Management Science 166, 687-713 (2012).
Summary: The main purpose of this chapter is to introduce the latest developments in SDPA and its family. SDPA is designed to solve large-scale SemiDefinite Programs (SDPs) faster and over the course of 15 years of development, it has been expanded into a high-performance-oriented software package. We hope that this introduction to the latest developments of the SDPA Family will be beneficial to readers who wish to understand the inside of state-of-art software packages for solving SDPs.
For the entire collection see [Zbl 1235.90002].

90C22 Semidefinite programming
90-02 Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
Full Text: DOI
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.