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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Acknowledgments. List of notation. 1. Introduction. Part I: Theory and Algorithms. 2. Duality, Optimality, and Degeneracy. 3. The Central Path. 4. Self-Dual Embeddings. 5. The Primal Logarithmic Barrier Method. 6. Primal-Dual Affine-Scaling Methods. 7. Primal-Dual Path-Following Methods. 8. Primal-Dual Potential Reduction Methods. Part II: Applications. 9. Convex Quadratic Approximation. 10. The Lovász upsilon-Function. 11. Graph Colouring and the Max-Kappa-Cut Problem. 12. The Stability Number of a Graph. 13. The Satisfiability Problem. Appendices. References. Index.
Book by Klerk E de
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9781402005473_new
Quantità: Più di 20 disponibili
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 308 pp. Englisch. Codice articolo 9781402005473
Quantità: 2 disponibili
Da: moluna, Greven, Germania
Gebunden. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 succes. Codice articolo 4091927
Quantità: Più di 20 disponibili
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condizione: New. 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. Series: Applied Optimization. Num Pages: 304 pages, biography. BIC Classification: PBU; PBW; UMG. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 235 x 155 x 19. Weight in Grams: 609. . 2002. Hardback. . . . . Codice articolo V9781402005473
Quantità: 15 disponibili
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 308. Codice articolo 26320812
Quantità: 4 disponibili
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Buch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 308 pp. Englisch. Codice articolo 9781402005473
Quantità: 1 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. Print on Demand pp. 308 Illus. Codice articolo 7559923
Quantità: 4 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Codice articolo 9781402005473
Quantità: 1 disponibili
Da: Biblios, Frankfurt am main, HESSE, Germania
Condizione: New. PRINT ON DEMAND pp. 308. Codice articolo 18320806
Quantità: 4 disponibili
Da: Revaluation Books, Exeter, Regno Unito
Hardcover. Condizione: Brand New. 300 pages. 9.25x6.25x0.75 inches. In Stock. Codice articolo x-1402005474
Quantità: 2 disponibili