Interior Point Approach to Linear, Quadratic and Convex Programming

Interior Point Approach to Linear, Quadratic and Convex Programming
Author :
Publisher : Springer Science & Business Media
Total Pages : 214
Release :
ISBN-10 : 9789401111348
ISBN-13 : 9401111340
Rating : 4/5 (340 Downloads)

Book Synopsis Interior Point Approach to Linear, Quadratic and Convex Programming by : D. den Hertog

Download or read book Interior Point Approach to Linear, Quadratic and Convex Programming written by D. den Hertog and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 214 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.


Interior Point Approach to Linear, Quadratic and Convex Programming Related Books

Interior Point Approach to Linear, Quadratic and Convex Programming
Language: en
Pages: 214
Authors: D. den Hertog
Categories: Mathematics
Type: BOOK - Published: 2012-12-06 - Publisher: Springer Science & Business Media

GET EBOOK

This book describes the rapidly developing field of interior point methods (IPMs). An extensive analysis is given of path-following methods for linear programmi
Interior-point Polynomial Algorithms in Convex Programming
Language: en
Pages: 414
Authors: Yurii Nesterov
Categories: Mathematics
Type: BOOK - Published: 1994-01-01 - Publisher: SIAM

GET EBOOK

Specialists working in the areas of optimization, mathematical programming, or control theory will find this book invaluable for studying interior-point methods
Lectures on Modern Convex Optimization
Language: en
Pages: 500
Authors: Aharon Ben-Tal
Categories: Technology & Engineering
Type: BOOK - Published: 2001-01-01 - Publisher: SIAM

GET EBOOK

Here is a book devoted to well-structured and thus efficiently solvable convex optimization problems, with emphasis on conic quadratic and semidefinite programm
Convex Optimization
Language: en
Pages: 744
Authors: Stephen P. Boyd
Categories: Business & Economics
Type: BOOK - Published: 2004-03-08 - Publisher: Cambridge University Press

GET EBOOK

Convex optimization problems arise frequently in many different fields. This book provides a comprehensive introduction to the subject, and shows in detail how
Primal-dual Interior-Point Methods
Language: en
Pages: 309
Authors: Stephen J. Wright
Categories: Interior-point methods
Type: BOOK - Published: 1997-01-01 - Publisher: SIAM

GET EBOOK

In the past decade, primal-dual algorithms have emerged as the most important and useful algorithms from the interior-point class. This book presents the major