Semidefinite Programming

Part of the Springer Optimization and Its Applications book series (SOIA, volume 62)


Semidefinite programming studies optimization problems with a linear objective function over semidefinite constraints. It shares many interesting properties with linear programming. In particular, a semidefinite program can be solved in polynomial time. Moreover, an integer quadratic programcan be transformed into a semidefinite programthrough relaxation. Therefore, if a combinatorial optimization problem can be formulated as an integer quadratic program, then we can approximate it using the semidefinite programming relaxation and other related techniques such as the primal’dual schema. As the semidefinite programming relaxation is a higher-order relaxation, it often produces better results than the linear programming relaxation, even if the underlying problem can be formulated as an integer linear program. In this chapter, we introduce the fundamental concepts of semidefinite programming, and demonstrate its application to the approximation of NP-hard combinatorial optimization problems, with various rounding techniques.


Approximation Algorithm Performance Ratio Cholesky Factorization Feasible Domain Linear Objective Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of Texas at DallasRichardsonUSA
  2. 2.Department of Computer ScienceState University of New York at Stony BrookStony BrookUSA
  3. 3.Institute of Applied MathematicsAcademy of Mathematics and Systems Science Chinese Academy of SciencesBeijingChina

Personalised recommendations