Chapter 2: Semidefinite Optimization

Pablo A. ParriloSociety 2012 · DOI · OpenAlex

Abstract

In this chapter we introduce one of the core theoretical and computational techniques in convex algebraic geometry, namely, semidefinite optimization. We begin by reviewing linear programming and proceed to define and discuss semidefinite programs from the algebraic, geometric, and computational perspectives. We define spectrahedra as the feasible sets of semidefinite programs, study their properties, and discuss numerous examples. Despite the many parallels, the duality theory of semidefinite optimization is more complicated than in the case of linear programming, and we elaborate on the similarities and differences. We also showcase a number of applications of semidefinite optimization in several areas of applied mathematics and engineering and give a short discussion of algorithmic and software aspects. For the convenience of the reader, we present additional background material on convex geometry and optimization in Appendix A.
BibTeX
@inproceedings{parrilo2012chapter,
  author = {Pablo A. Parrilo},
  title = {{Chapter 2: Semidefinite Optimization}},
  booktitle = {Society},
  year = {2012},
  doi = {10.1137/1.9781611972290.ch2},
}

Loading related content...

Figure