Aspects of semidefinite programming
by Etienne de Klerk
2002
About
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.
Discuss Aspects of semidefinite programming with other readers
Join or start a book club for Aspects of semidefinite programming on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.
Frequently asked questions
How do I join a book club for Aspects of semidefinite programming?
Sign up free on Readfeed, then browse public clubs or start your own club with Aspects of semidefinite programming as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.
Can I discuss Aspects of semidefinite programming with other readers online?
Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Aspects of semidefinite programming with readers worldwide — whether your club is virtual, in-person, or hybrid.
Is Readfeed free?
Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.