Linear and Nonlinear Optimization
Provides an introduction to the applications, theory, and algorithms of linear and nonlinear optimization. The emphasis is on practical aspects - discussing modern algorithms, as well as the influence of theory on the interpretation of solutions or on the design of software. The book includes several examples of realistic optimization models that address important applications. The succinct style of this second edition is punctuated with numerous real-life examples and exercises, and the authors include accessible explanations of topics that are not often mentioned in textbooks, such as duality in nonlinear optimization, primal-dual methods for nonlinear optimization, filter methods, and applications such as support-vector machines. The book is designed to be flexible. It has a modular structure, and uses consistent notation and terminology throughout. It can be used in many different ways, in many different courses, and at many different levels of sophistication.
- Supporting web site with data sets that are necessary for some of the book's exercises
- Three appendices on linear algebra, other fundamentals, and software packages for optimization problems
- Contains numerous examples and exercises to help the reader gain a deeper understanding
Product details
March 2009Hardback
9780898716610
764 pages
261 × 181 × 37 mm
1.49kg
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
- Part I. Basics:
- 1. Optimization models
- 2. Fundamentals of optimization
- 3. Representation of linear constraints
- Part II. Linear Programming:
- 4. Geometry of linear programming
- 5. The simplex method
- 6. Duality and sensitivity
- 7. Enhancements of the simplex method
- 8. Network problems
- 9. Computational complexity of linear programming
- 10. Interior-point methods of linear programming
- Part III. Unconstrained Optimization:
- 11. Basics of unconstrained optimization
- 12. Methods for unconstrained optimization
- 13. Low-storage methods for unconstrained problems
- Part IV. Nonlinear Optimization:
- 14. Optimality conditions for constrained problems
- 15. Feasible-point methods
- 16. Penalty and barrier methods
- Part V. Appendices: Appendix A. Topics from linear algebra
- Appendix B. Other fundamentals
- Appendix C. Software
- Bibliography
- Index.