Modern Numerical Nonlinear Optimization
portes grátis
Modern Numerical Nonlinear Optimization
Andrei, Neculai
Springer International Publishing AG
04/2026
1075
Dura
Inglês
9783031946936
Pré-lançamento - envio 15 a 20 dias após a sua edição
Descrição não disponível.
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. Optimality conditions for nonlinear optimization.- 11. Constrained nonlinear optimization methods.- 12. Simple bound optimization.- 13. Quadratic programming.- 14. Penalty and augmented Lagrangian.- 15. Sequential quadratic programming.- 16. Primal methods. The generalized reduced gradient with sequential linearization. -17. Interior-point methods.- 18. Filter methods.- 19. Interior-point filter line search (IPOPT).- 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.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
unconstrained optimization;stepsize computation;steepest descent method;Newton method;conjugate gradient method;quasi-Newton methods;inexact Newton method;trust-region method;constrained nonlinear optimization;simple bound optimization;quadratic programming;augmented Lagrangian;penalty Lagrangian;sequential quadratic programming;Interior-point methods;filter methods;SMUNO;LACOP;MINIPACK-2
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. Optimality conditions for nonlinear optimization.- 11. Constrained nonlinear optimization methods.- 12. Simple bound optimization.- 13. Quadratic programming.- 14. Penalty and augmented Lagrangian.- 15. Sequential quadratic programming.- 16. Primal methods. The generalized reduced gradient with sequential linearization. -17. Interior-point methods.- 18. Filter methods.- 19. Interior-point filter line search (IPOPT).- 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.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
unconstrained optimization;stepsize computation;steepest descent method;Newton method;conjugate gradient method;quasi-Newton methods;inexact Newton method;trust-region method;constrained nonlinear optimization;simple bound optimization;quadratic programming;augmented Lagrangian;penalty Lagrangian;sequential quadratic programming;Interior-point methods;filter methods;SMUNO;LACOP;MINIPACK-2
