A Mathematical View of Interior-point Methods in Convex Optimization
Author | : James Renegar |
Publisher | : SIAM |
Total Pages | : 124 |
Release | : 2001-01-01 |
ISBN-10 | : 0898718813 |
ISBN-13 | : 9780898718812 |
Rating | : 4/5 (13 Downloads) |
Book excerpt: Here is a book devoted to well-structured and thus efficiently solvable convex optimization problems, with emphasis on conic quadratic and semidefinite programming. The authors present the basic theory underlying these problems as well as their numerous applications in engineering, including synthesis of filters, Lyapunov stability analysis, and structural design. The authors also discuss the complexity issues and provide an overview of the basic theory of state-of-the-art polynomial time interior point methods for linear, conic quadratic, and semidefinite programming. The book's focus on well-structured convex problems in conic form allows for unified theoretical and algorithmical treatment of a wide spectrum of important optimization problems arising in applications.