The Leading eBooks Store Online 4,272,009 members ⚫ 1,419,367 ebooks

New to eBooks.com?

Learn more

Aspects of Semidefinite Programming

Interior Point Algorithms and Selected Applications

Aspects of Semidefinite Programming by E. de Klerk
Buy this eBook
US$ 209.00
(If any tax is payable it will be calculated and shown at checkout.)
Semidefinite programming has been described as linear programming for the year 2000. It is an exciting new branch of mathematical programming, due to important applications in control theory, combinatorial optimization and other fields. Moreover, the successful interior point algorithms for linear programming can be extended to semidefinite programming.
In this monograph the basic theory of interior point algorithms is explained. This includes the latest results on the properties of the central path as well as the analysis of the most important classes of algorithms. Several "classic" applications of semidefinite programming are also described in detail. These include the Lovász theta function and the MAX-CUT approximation algorithm by Goemans and Williamson.
Audience: Researchers or graduate students in optimization or related fields, who wish to learn more about the theory and applications of semidefinite programming.
Springer US; April 2006
305 pages; ISBN 9780306478192
Read online, or download in secure PDF format
Title: Aspects of Semidefinite Programming
Author: E. de Klerk
 
  • News
  • Contents
No entry found