Aspects of Semidefinite Programming

Aspects of Semidefinite Programming

Interior Point Algorithms and Selected Applications

eBook - 2002
Rate this:
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.
Publisher: Dordrecht ; Boston : Kluwer Academic Publishers, 2002
ISBN: 9780306478192
Branch Call Number: 519.72 Kl
Description: 1 online resource (xvi, 283 pages) : illustrations
Additional Contributors: EBSCOhost (Online service)

Opinion

From the critics


Community Activity

Comment

Add a Comment

There are no comments for this title yet.

Age

Add Age Suitability

There are no ages for this title yet.

Summary

Add a Summary

There are no summaries for this title yet.

Notices

Add Notices

There are no notices for this title yet.

Quotes

Add a Quote

There are no quotes for this title yet.

Explore Further

Browse by Call Number

Recommendations

Subject Headings

LibraryThing Series Information


  Loading...

Find it at CRRL

  Loading...
[]
[]
To Top