---

＜電子ブック＞
Numerical Optimization : Theoretical and Practical Aspects / by Joseph-Frédéric Bonnans, Jean Charles Gilbert, Claude Lemarechal, Claudia A. Sagastizábal
(Universitext. ISSN:21916675)

版	1st ed. 2003.
出版者	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年	2003
本文言語	英語
大きさ	XIII, 423 p. 7 illus : online resource
著者標目	*Bonnans, Joseph-Frédéric author Gilbert, Jean Charles author Lemarechal, Claude author Sagastizábal, Claudia A author SpringerLink (Online service)
件　名	LCSH:Mathematical optimization LCSH:Operations research LCSH:Management science LCSH:Calculus of variations LCSH:Numerical analysis LCSH:Algorithms LCSH:Computer science -- Mathematics  全ての件名で検索 FREE:Optimization FREE:Operations Research, Management Science FREE:Calculus of Variations and Optimization FREE:Numerical Analysis FREE:Algorithms FREE:Mathematics of Computing
一般注記	1 General Introduction -- 2 Basic Methods -- 3 Line-Searches -- 4 Newtonian Methods -- 5 Conjugate Gradient -- 6 Special Methods -- 7 Some Theory of Nonsmooth Optimization -- 8 Some Methods in Nonsmooth Optimization -- 9 Bundle Methods. The Quest of Descent -- 10 Decomposition and Duality -- 11 Background -- 12 Local Methods for Problems with Equality Constraints -- 13 Local Methods for Problems with Equality and Inequality Constraints -- 14 Exact Penalization -- 15 Globalization by Line-Search -- 16 Quasi-Newton Versions -- 17 Linearly Constrained Optimization and Simplex Algorithm -- 18 Linear Monotone Complementarity and Associated Vector Fields -- 19 Predictor-Corrector Algorithms -- 20 Non-Feasible Algorithms -- 21 Self-Duality -- 22 One-Step Methods -- 23 Complexity of Linear Optimization Problems with Integer Data -- 24 Karmarkar’s Algorithm -- References Starting with illustrative real-world examples, this book exposes in a tutorial way algorithms for numerical optimization: fundamental ones (Newtonian methods, line-searches, trust-region, sequential quadratic programming, etc.), as well as more specialized and advanced ones (nonsmooth optimization, decomposition techniques, and interior-point methods). Most of these algorithms are explained in a detailed manner, allowing straightforward implementation. Theoretical aspects are addressed with care, often using minimal assumptions. The present version contains substantial changes with respect to the first edition. Part I on unconstrained optimization has been completed with a section on quadratic programming. Part II on nonsmooth optimization has been thoroughly reorganized and expanded. In addition, nontrivial application problems have been inserted, in the form of computational exercises. These should help the reader to get a better understanding of optimization methods beyond their abstract description, by addressing important features to be taken into account when passing to implementation of any numerical algorithm. This level of detail is intended to familiarize the reader with some of the crucial questions of numerical optimization: how algorithms operate, why they converge, difficulties that may be encountered and their possible remedies. HTTP:URL=https://doi.org/10.1007/978-3-662-05078-1

 類似資料