Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications
Author:   E. de Klerk
Publisher:   Springer-Verlag New York Inc.
Edition:   2002 ed.
Volume:   65
ISBN:  

9781402005473


Pages:   288
Publication Date:   31 March 2002
Format:   Hardback
Availability:   Out of print, replaced by POD   Availability explained
We will order this item for you from a manufatured on demand supplier.

Our Price $525.36 Quantity:  
Add to Cart

Share |

Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications


Add your own review!

Overview

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 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.

Full Product Details

Author:   E. de Klerk
Publisher:   Springer-Verlag New York Inc.
Imprint:   Springer-Verlag New York Inc.
Edition:   2002 ed.
Volume:   65
Dimensions:   Width: 15.50cm , Height: 1.90cm , Length: 23.50cm
Weight:   1.340kg
ISBN:  

9781402005473


ISBN 10:   1402005474
Pages:   288
Publication Date:   31 March 2002
Audience:   College/higher education ,  Professional and scholarly ,  Postgraduate, Research & Scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   Out of print, replaced by POD   Availability explained
We will order this item for you from a manufatured on demand supplier.

Table of Contents

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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
 Shopping cart
Mailing List

 

Sign up now