Cantitate/Preț
Produs

Aspects of Semidefinite Programming: Applied Optimization, cartea 65

Autor E. de Klerk
en Limba Engleză Hardback – 31 mar 2002
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 94108 lei  43-57 zile
  Springer – 10 dec 2010 94108 lei  43-57 zile
Hardback (1) 94657 lei  43-57 zile
  Springer – 31 mar 2002 94657 lei  43-57 zile

Din seria Applied Optimization

Preț: 94657 lei

Preț vechi: 118322 lei
-20%

Puncte Express: 1420

Preț estimativ în valută:
16738 19194$ 14466£

Carte tipărită la comandă

Livrare economică 27 aprilie-11 mai


Specificații

ISBN-13: 9781402005473
ISBN-10: 1402005474
Pagini: 308
Ilustrații: XVI, 288 p.
Dimensiuni: 160 x 241 x 22 mm
Greutate: 0.63 kg
Ediția:2002
Editura: Springer
Colecția Applied Optimization
Seria Applied Optimization

Locul publicării:New York, NY, United States

Public țintă

Research

Cuprins

Theory and Algorithms.- Duality, Optimality, and Degeneracy.- The Central Path.- Self-Dual Embeddings.- The Primal Logarithmic Barrier Method.- Primal-Dual Affine-Scaling Methods.- Primal-Dual Path-Following Methods.- Primal-Dual Potential Reduction Methods.- Selected Applications.- Convex Quadratic Approximation.- The Lovász ?-Function.- Graph Coulouring and the Max-K-Cut Problem.- The Stability Number of a Graph and Standard Quadratic Optimization.- The Satisfiability Problem.