Interior Point Polynomial Algorithms in Convex Programming

Front Cover
SIAM, Jan 1, 1987 - Mathematics - 405 pages
0 Reviews
Written for specialists working in optimization, mathematical programming, or control theory. The general theory of path-following and potential reduction interior point polynomial time methods, interior point methods, interior point methods for linear and quadratic programming, polynomial time methods for nonlinear convex programming, efficient computation methods for control problems and variational inequalities, and acceleration of path-following methods are covered. In this book, the authors describe the first unified theory of polynomial-time interior-point methods. Their approach provides a simple and elegant framework in which all known polynomial-time interior-point methods can be explained and analyzed; this approach yields polynomial-time interior-point methods for a wide variety of problems beyond the traditional linear and quadratic programs.
 

What people are saying - Write a review

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

Contents

AM13_ch1
1
AM13_ch2
11
AM13_ch3
57
AM13_ch4
101
AM13_ch5
147
AM13_ch6
217
AM13_ch7
273
AM13_ch8
315
AM13_appendixa
361
AM13_appendixb
365
AM13_backmatter
379
Copyright

Other editions - View all

Common terms and phrases