<< 1 >>
Rating: 
Summary: A simplifying perspective of IPM's in Convex Optimization
Review: At last, we find a book which develops a thorough understanding
of the most general theory of interior point methods for
convex optimization, and is easily accessible. As the author
himself remarks "Much of the literature on the general
theory of interior point methods is difficult to understand,
even for specialists. My hope is that this book will make
the most general theory accessible to a wide audience -
especially Ph.D. students, the next generation of optimizers".
The book covers basic interior point theory including
the theory of self concordant functionals. There is a chapter
on conic programming covering the relationship between interior point
methods and duality theory, and the development
of primal dual interior point algorithms for solving conic
optimization problems (Conic programming includes linear,
semidefinite and second order cone programming as special
cases!).One can then "perhaps" take on Nesterov and Nemirovskii's
seminal treatise on Interior Point Polynomial Algorithms
in Convex Programming, one of the most widely cited references
in optimization, which I must confess is not exactly
an easy read. To summarize, conic optimization and efficient interior point
methods to solve them are certainly one of the most exciting
areas in optimization recently, and Renegar's excellent,
intuitive and short book is a welcome addition to the
bookshelf of any serious optimizer!. Strongly recommended!
<< 1 >>
| 
