Overview
- Nonlinear optimization algorithms for solving large-scale unconstrained and constrained optimization applications
- Optimization methods that are currently the most valuable for solving real-life problems and applications
- Provides theoretical background which gives insights into how the methods are derived
Part of the book series: Springer Optimization and Its Applications (SOIA, volume 195)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (20 chapters)
Keywords
- 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
About this book
This book includes a thorough theoretical and computational analysis of unconstrained and constrained optimization algorithms and combines and integrates the most recent techniques and advanced computational linear algebra methods. Nonlinear optimization methods and techniques have reached their maturity and an abundance of optimization algorithms are available for which both the convergence properties and the numerical performances are known. This clear, friendly, and rigorous exposition discusses the theory behind the nonlinear optimization algorithms for understanding their properties and their convergence, enabling the reader to prove the convergence of his/her own algorithms. It covers cases and computational performances of the most known modern nonlinear optimization algorithms that solve collections of unconstrained and constrained optimization test problems with different structures, complexities, as well as those with large-scale real applications.
The book is addressed to all those interested in developing and using new advanced techniques for solving large-scale unconstrained or constrained complex optimization problems. Mathematical programming researchers, theoreticians and practitioners in operations research, practitioners in engineering and industry researchers, as well as graduate students in mathematics, Ph.D. and master in mathematical programming will find plenty of recent information and practical approaches for solving real large-scale optimization problems and applications.
Reviews
Authors and Affiliations
About the author
Bibliographic Information
Book Title: Modern Numerical Nonlinear Optimization
Authors: Neculai Andrei
Series Title: Springer Optimization and Its Applications
DOI: https://doi.org/10.1007/978-3-031-08720-2
Publisher: Springer Cham
eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)
Copyright Information: The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2022
Hardcover ISBN: 978-3-031-08719-6Published: 19 October 2022
Softcover ISBN: 978-3-031-08722-6Published: 19 October 2023
eBook ISBN: 978-3-031-08720-2Published: 18 October 2022
Series ISSN: 1931-6828
Series E-ISSN: 1931-6836
Edition Number: 1
Number of Pages: XXXIII, 807
Number of Illustrations: 9 b/w illustrations, 108 illustrations in colour
Topics: Optimization, Computational Mathematics and Numerical Analysis, Algorithms