國立虎尾科技大學 |

Modern Numerical Nonlinear Optimization

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Modern Numerical Nonlinear Optimization/ by Neculai Andrei.
Author:	Andrei, Neculai.
Description:	XXXIII, 807 p. 117 illus., 108 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Mathematical optimization. -
Online resource:	https://doi.org/10.1007/978-3-031-08720-2
ISBN:	9783031087202

Modern Numerical Nonlinear Optimization
Andrei, Neculai.

Modern Numerical Nonlinear Optimization[electronic resource] /by Neculai Andrei. - 1st ed. 2022. - XXXIII, 807 p. 117 illus., 108 illus. in color.online resource. - Springer Optimization and Its Applications,1951931-6836 ;. - Springer Optimization and Its Applications,104.

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.

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.

ISBN: 9783031087202

Standard No.: 10.1007/978-3-031-08720-2doiSubjects--Topical Terms:

527675
Mathematical optimization.

LC Class. No.: QA402.5-402.6

Dewey Class. No.: 519.6

Modern Numerical Nonlinear Optimization
LDR:04092nam a22004095i 4500 001 1084384
003 DE-He213
005 20221018064951.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 $a 9783031087202 $9 978-3-031-08720-2
024 7 $a 10.1007/978-3-031-08720-2 $2 doi
035 $a 978-3-031-08720-2
050 4 $a QA402.5-402.6
072 7 $a PBU $2 bicssc
072 7 $a MAT003000 $2 bisacsh
072 7 $a PBU $2 thema
082 0 4 $a 519.6 $2 23
100 1 $a Andrei, Neculai. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1077311
245 1 0 $a Modern Numerical Nonlinear Optimization $h [electronic resource] / $c by Neculai Andrei.
250 $a 1st ed. 2022.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a XXXIII, 807 p. 117 illus., 108 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Springer Optimization and Its Applications, $x 1931-6836 ; $v 195
505 0 $a 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.
520 $a 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.
650 0 $a Mathematical optimization. $3 527675
650 0 $a Mathematics—Data processing. $3 1365953
650 0 $a Algorithms. $3 527865
650 1 4 $a Optimization. $3 669174
650 2 4 $a Computational Mathematics and Numerical Analysis. $3 669338
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783031087196
776 0 8 $i Printed edition: $z 9783031087219
776 0 8 $i Printed edition: $z 9783031087226
830 0 $a Springer Optimization and Its Applications, $x 1931-6828 ; $v 104 $3 1255232
856 4 0 $u https://doi.org/10.1007/978-3-031-08720-2
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)