| 書目名稱 | Introduction to Methods for Nonlinear Optimization |
| 編輯 | Luigi Grippo,Marco Sciandrone |
| 視頻video | http://file.papertrans.cn/474/473902/473902.mp4 |
| 概述 | Can be used at both the undergraduate and graduate level.Organizes several key topics into teaching units.Offers novel topics in nonlinear optimization |
| 叢書名稱 | UNITEXT |
| 圖書封面 |  |
| 描述 | .This book has two main objectives:. ???to provide a concise introduction to nonlinear optimization methods, which can be used as a textbook at a graduate or upper undergraduate level;. ? ?to collect and organize selected important?topics on optimization algorithms, not easily found in textbooks, which can provide material for advanced courses or can serve as a reference text for self-study and research.. The basic material on unconstrained and constrained optimization is organized into two blocks of chapters: . ??? basic theory and optimality conditions. ??? unconstrained and constrained algorithms.. These topics are treated in short chapters that contain the most important results in theory ?and algorithms, in a way that, in the authors’ experience, is suitable for introductory courses. ?. A third block of chapters addresses methods that are of increasing interest for solving difficult optimization problems. Difficulty can be typically due to the high nonlinearity of the objective function, ill-conditioning of the Hessian matrix, lack of information on first-order derivatives, the need to solve large-scale problems. . In the book various key subjects are addressed, including: exa |
| 出版日期 | Textbook 2023 |
| 關鍵詞 | Optimization; Nonlinear Programming; Operations Research; Computational methods; Nonlinear equations |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-031-26790-1 |
| isbn_softcover | 978-3-031-26789-5 |
| isbn_ebook | 978-3-031-26790-1Series ISSN 2038-5714 Series E-ISSN 2532-3318 |
| issn_series | 2038-5714 |
| copyright | Springer Nature Switzerland AG 2023 |
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網安備110108008328)
GMT+8, 2026-2-7 05:39
發(fā)表于 2025-3-21 16:30:18
