Introduction to Semidefinite, Conic and Polynomial Optimization

Miguel F. Anjos () and Jean B. Lasserre ()
Additional contact information
Miguel F. Anjos: École Polytechnique de Montréal
Jean B. Lasserre: LAAS-CNRS and Institute of Mathematics

Chapter Chapter 1 in Handbook on Semidefinite, Conic and Polynomial Optimization, 2012, pp 1-22 from Springer

Abstract: Abstract Conic optimization refers to the problem of optimizing a linear function over the intersection of an affine space and a closed convex cone. We focus particularly on the special case where the cone is chosen as the cone of positive semidefinite matrices for which the resulting optimization problem is called a semidefinite optimization problem.

Keywords: Polynomial Optimization; Semidefinite Optimization Problems; Semidefinite Relaxation; Semidefinite Programming (SDP); Basic Semi-algebraic Set (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_1

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

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

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 ().