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

Front Cover
Kluwer Academic Pub, 1994 - Mathematics - 208 pages
0 Reviews
In this book the rapidly developing field of Interior Point Methods (IPMs) is described. An extensive analysis of so-called path-following methods for linear programming, quadratic programming and convex programming is given. 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.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

The logarithmic barrier method
9
The center method
73
Reducing the complexity for LP
111
Copyright

5 other sections not shown

Other editions - View all

Common terms and phrases

References to this book

All Book Search results »