Get Free Shipping on orders over $79
Aspects of Semidefinite Programming : Interior Point Algorithms and Selected Applications - E. de Klerk

Aspects of Semidefinite Programming

Interior Point Algorithms and Selected Applications

By: E. de Klerk

eText | 18 April 2006

At a Glance

eText


$239.00

or 4 interest-free payments of $59.75 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.
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 Lovasz 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.
on
Desktop
Tablet
Mobile

More in Computer Programming & Software Development

The End of Leadership - Barbara Kellerman

eBOOK