Semidefinite Programming

Ding-Zhu Du (), Ker-I Ko () and Xiaodong Hu ()
Additional contact information
Ding-Zhu Du: University of Texas at Dallas
Ker-I Ko: State University of New York at Stony Brook
Xiaodong Hu: Academy of Mathematics and Systems Science Chinese Academy of Sciences

Chapter 9 in Design and Analysis of Approximation Algorithms, 2012, pp 339-370 from Springer

Abstract: Abstract 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.

Keywords: Approximation Algorithm; Performance Ratio; Cholesky Factorization; Feasible Domain; Linear Objective Function (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

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:spochp:978-1-4614-1701-9_9

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

DOI: 10.1007/978-1-4614-1701-9_9

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().