Skip to content
Home/ Interior Point Approach to Linear, Quadratic and Convex Programming: Algorithms and Complexity (1994
Interior Point Approach to Linear, Quadratic and Convex Programming: Algorithms and Complexity (1994

Interior Point Approach to Linear, Quadratic and Convex Programming: Algorithms and Complexity (1994

No customer reviews yet ISBN 9780792327349

This book describes the rapidly developing field of interior point methods (IPMs). An extensive analysis is given of path-following methods for linear programming, quadratic programming and convex programming. These methods, which form a subclass of interior point methods, follow the central path, which is an analytic curve defined by the problem. Relatively simple and elegant proofs for polynomiality are given. The theory is illustrated using several explicit examples. Moreover, an overview of other classes of IPMs is given. It is shown that all these methods rely on the same notion as the path-following methods: all these methods use the central path implicitly or explicitly as a reference path to go to the optimum.
For specialists in IPMs as well as those seeking an introduction to IPMs. The book is accessible to any mathematician with basic mathematical programming knowledge.

About the author

Product details

Pub dateMar 31, 1994
ISBN-100792327349
ISBN-139780792327349
LanguageEnglish
Last updated 2026-03-13 04:30
$57.47
In stock — ships in 24 hours with free tracking
Delivery by Monday, September 14, 2026
Qty
Sign in to Add to Saved list
Free delivery on orders over $35.
15-day returns. Any reason.
Secure checkout. We never store card details.

Readers who bought this also bought

More from Computers | Machine Theory
See all