Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications

— —

E. de Klerk

Aspects of Semidefinite Programming

Interior Point Algorithms and Selected Applications

E. de Klerk

$370.95 $296.98

Hardback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Kluwer Academic Publishers
31 March 2002

Optimisation; Applied mathematics; Aspect programming & AOP

Series: Applied Optimization

Summary
Details

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.

By: E. de Klerk
Imprint: Kluwer Academic Publishers
Country of Publication: United States [Currently unable to ship to USA: see Shipping Info]
Edition: 2002 ed.
Volume: 65
Dimensions: Height: 235mm, Width: 155mm, Spine: 19mm
Weight: 1.340kg
ISBN: 9781402005473
ISBN 10: 1402005474
Series: Applied Optimization
Pages: 288
Publication Date: 31 March 2002
Audience: College/higher education , Professional and scholarly , Further / Higher Education , Undergraduate
Format: Hardback
Publisher's Status: Active