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

ISBN-13: 9789401044967 / Angielski / Miękka / 2012 / 210 str.

D. Den Hertog

Opis

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.

Recenzje

`This book presents a general and rigorous foundation for solving nonlinear convex optimization problems. The book is well and clearly written. It is comprehensive and well-balanced ... excellent text for an advanced or seminar course on optimization, primarily addressed to graduate students in mathematics, pure or applied, computer science and engineering schools. ... researchers will also find it a valuable reference because the theorems contained in many of its sections represent the current state of the art. ... extensive bibliographic section is another strong point of the book, quite complete and up to date. I believe this work will remain a basic reference for whomever is interested in convex optimization for years to come. '
Optima, 47, 1995

Spis treści

Glossary of Symbols and Notations. 1. Introduction of IPMs. 2. The logarithmic barrier method. 3. The center method. 4. Reducing the complexity for LP. 5. Discussion of other IPMs. 6. Summary, conclusions and recommendations. Appendices: A. Self-concordance proofs. B. General technical lemmas. Bibliography. Index.