Matches in Harvard for { <http://id.lib.harvard.edu/aleph/009154960/catalog> ?p ?o. }
Showing items 1 to 29 of
29
with 100 items per page.
- catalog abstract "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.".
- catalog alternative "Optimisation numérique. English.".
- catalog contributor b12898958.
- catalog created "c2003.".
- catalog date "2003".
- catalog date "c2003.".
- catalog dateCopyrighted "c2003.".
- catalog description "General Introduction -- Part I: Unconstraint Problems: Basic Methods; Line-Searches; Newtonian Methods; Conjugate Gradient; Special Methods -- Part II: Nonsmooth Optimization: Some Theory of Nonsmooth Optimization; Some Methods in Nonsmooth Optimization; Bundle Methods. The Quest of Decent; Decomposition and Duality -- Part III: Newton's Methods in Constrained Optimization: Background; Local Methods for Problems with Equality Constraints; Local Methods for Problems with Equality and Inequality Constraints; Exact Penalization; Globalization by Line-Search; Quasi-Newton Versions -- Part IV: Interior-Point Algorithms for Linear and Quadratic Optimization: Linearly Constrained Optimization and Simplex Algorithm; Linear Monotone Complementary and Associated Vector Fields; Predictor-Corrector Algorithms; Non-Feasible Algorithms; Self-Duality; One-Step Methods; Complexity of Linear Optimization Problems with Integer Data; Karmarkar's Algorithm -- References -- Index.".
- catalog description "Includes bibliographical references (p. [397]-413) and index.".
- catalog description "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.".
- catalog extent "xiii, 419 p. :".
- catalog identifier "3540001913 (pbk. : acid-free paper)".
- catalog isPartOf "Universitext".
- catalog issued "2003".
- catalog issued "c2003.".
- catalog language "eng fre".
- catalog language "eng".
- catalog publisher "Berlin ; New York : Springer,".
- catalog subject "519.3 21".
- catalog subject "Computer science.".
- catalog subject "Computer software.".
- catalog subject "Engineering.".
- catalog subject "Mathematical optimization.".
- catalog subject "Mathematics.".
- catalog subject "Numerical analysis.".
- catalog subject "QA402.5 .O63613 2003".
- catalog tableOfContents "General Introduction -- Part I: Unconstraint Problems: Basic Methods; Line-Searches; Newtonian Methods; Conjugate Gradient; Special Methods -- Part II: Nonsmooth Optimization: Some Theory of Nonsmooth Optimization; Some Methods in Nonsmooth Optimization; Bundle Methods. The Quest of Decent; Decomposition and Duality -- Part III: Newton's Methods in Constrained Optimization: Background; Local Methods for Problems with Equality Constraints; Local Methods for Problems with Equality and Inequality Constraints; Exact Penalization; Globalization by Line-Search; Quasi-Newton Versions -- Part IV: Interior-Point Algorithms for Linear and Quadratic Optimization: Linearly Constrained Optimization and Simplex Algorithm; Linear Monotone Complementary and Associated Vector Fields; Predictor-Corrector Algorithms; Non-Feasible Algorithms; Self-Duality; One-Step Methods; Complexity of Linear Optimization Problems with Integer Data; Karmarkar's Algorithm -- References -- Index.".
- catalog title "Numerical optimization : theoretical and practical aspects / J. Frédéric Bonnans ... [et al.].".
- catalog type "text".