This book provides an introduction to the mathematical theory of optimization. It emphasizes the convergence theory of nonlinear optimization algorithms and applications of nonlinear optimization to combinatorial optimization. Mathematical Theory of Optimization includes recent developments in global convergence, the Powell conjecture, semidefinite programming, and relaxation techniques for designs of approximation solutions of combinatorial optimization problems.

Inhalt

Preface. 1. Optimization Problems. 2. Linear Programming. 3. Blind Man's Method. 4. Hitting Walls. 5. Slope and Path Length. 6. Average Slope. 7. Inexact Active Constraints. 8. Efficiency. 9. Variable Metric Methods. 10. Powell's Conjecture. 11. Minimax. 12. Relaxation. 13. Semidefinite Programming. 14. Interior Point Methods. 15. From Local to Global. Historical Notes. Bibliography. Index.