1. Introduction
2. Fundamentals on unconstrained optimization.-3 . Steepest descent method
4. Newton method
5. Conjugate gradient methods
6. Quasi-Newton methods
7. Inexact Newton method
8. Trust-region method
9. Direct methods for unconstrained optimization
10. Constrained nonlinear optimization methods
11. Optimality conditions for nonlinear optimization
12. Simple bound optimization
13. Quadratic programming
14. Penalty and augmented Lagrangian
15. Sequential quadratic programming
16. Generalized reduced gradient with sequential linearization. (CONOPT) - 17. Interior-point methods
18. Filter methods
19. Interior-point filter line search (IPOPT)
Direct methods for constrained optimization
20. Direct methods for constrained optimization
Appendix A. Mathematical review
Appendix B. SMUNO collection. Small scale optimization applications
Appendix C. LACOP collection. Large-scale continuous nonlinear optimization applications
Appendix D. MINPACK-2 collection. Large-scale unconstrained optimization applications
References
Author Index
Subject Index.