Interior Point Algorithms and Selected Applications
نام نخستين پديدآور
by Etienne Klerk.
وضعیت نشر و پخش و غیره
محل نشرو پخش و غیره
Boston, MA
نام ناشر، پخش کننده و غيره
Springer US
تاریخ نشرو بخش و غیره
2004
مشخصات ظاهری
نام خاص و کميت اثر
(xvi, 288 pages).
فروست
عنوان فروست
Applied optimization, 65.
یادداشتهای مربوط به خلاصه یا چکیده
متن يادداشت
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.
موضوع (اسم عام یاعبارت اسمی عام)
موضوع مستند نشده
Computer science -- Mathematics.
موضوع مستند نشده
Information theory.
موضوع مستند نشده
Mathematics.
رده بندی کنگره
شماره رده
T57
.
74
نشانه اثر
B948
2004
نام شخص به منزله سر شناسه - (مسئولیت معنوی درجه اول )