Lectures on Modern Convex Optimization
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.
Product details
August 2001Paperback
9780898714913
504 pages
254 × 178 × 25 mm
0.864kg
This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied Mathematics for availability.
Table of Contents
- Preface
- Lecture 1. Linear Programming
- Lecture 2. From Linear Programming to Conic Programming
- Lecture 3. Conic Quadratic Programming
- Lecture 4. Semidefinite Programming
- Lecture 5. Computational Tractability of Convex Programs
- Lecture 6. Interior Point Polynomial Time Methods for Linear Programming, Conic Quadratic Programming, and Semidefinite Programming
- Solutions to Selected Exercises
- Index.