• usp_easy_retunsFree & Easy Returns
  • usp_best_dealsBest Deals
placeholder
Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications
magnifyZoom

Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications

Sorry! This product is not available.
Available Soon
Product Overview

Specifications

PublisherSpringer; Softcover reprint of the original 1st ed. 2002 edition
ISBN 101441952160
AuthorE. de Klerk
LanguageEnglish
Number of Pages308 pages
ISBN 139781441952165
Book DescriptionSemidefinite 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.
Book FormatPaperback
Publication Date10 December 2010
Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications
Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications
Sorry! This product is not available.
Available Soon

We're Always Here To Help

Reach out to us through any of these support channels

Shop On The Go