Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications (Hardback)
$206.30 - Save $47.56 18% off - RRP $253.86 Free delivery worldwide (to United States and
all these other countries) Usually dispatched within 72 hours
Short Description for Aspects of Semidefinite Programming Semidefinite programming has been described as linear programming for the year 2000. This monograph explains the basic theory of interior point algorithms. It includes the results on the properties of the central path as well as the analysis of the most important classes of algorithms.
- Published: 31 March 2002
- Format: Hardback 304 pages
- ISBN 13: 9781402005473 ISBN 10: 1402005474
$32.60 - Save $20.48 38% off - RRP $53.08
$49.15 - Save $20.52 29% off - RRP $69.67
$33.96 - Save $18.30 35% off - RRP $52.26
$76.49 - Save $13.11 14% off - RRP $89.60
$285.60 - Save $57.02 16% off - RRP $342.62
Full description for Aspects of Semidefinite Programming
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.