Optimization—Theory and Practice
Forst, Wilhelm.
creator
author.
Hoffmann, Dieter.
author.
SpringerLink (Online service)
text
xxu
2010
monographic
eng
access
XVIII, 402 p. online resource.
Optimization is an important field in its own right but also plays a central role in numerous applied sciences, including operations research, management science, economics, finance, and engineering. Optimization — Theory and Practice offers a modern and well-balanced presentation of various optimization techniques and their applications. The book's clear structure, sound theoretical basics complemented by insightful illustrations and instructive examples, makes it an ideal introductory textbook and provides the reader with a comprehensive foundation in one of the most fascinating and useful branches of mathematics. Notable features include: Detailed explanations of theoretic results accompanied by supporting algorithms and exercises, often supplemented by helpful hints or MATLAB®/MAPLE® code fragments; an overview of the MATLAB® Optimization Toolbox and demonstrations of its uses with selected examples; accessibility to readers with a knowledge of multi-dimensional calculus, linear algebra, and basic numerical methods. Written at an introductory level, this book is intended for advanced undergraduates and graduate students, but may also be used as a reference by academics and professionals in mathematics and the applied sciences.
1. Introduction: Examples of Optimization Problems, Historical Overview -- 2. Optimality Conditions: Convex Sets, Inequalities, Local First- and Second-Order Optimality Conditions, Duality -- 3. Unconstrained Optimization Problems: Elementary Search and Localization Methods, Descent Methods with Line Search, Trust Region Methods, Conjugate Gradient Methods, Quasi-Newton Methods -- 4. Linearly Constrained Optimization Problems: Linear and Quadratic Optimization, Projection Methods -- 5. Nonlinearly Constrained Optimization Methods: Penalty Methods, SQP Methods -- 6. Interior-Point Methods for Linear Optimization: The Central Path, Newton's Method for the Primal-Dual System, Path-Following Algorithms, Predictor-Corrector Methods -- 7. Semidefinite Optimization: Selected Special Cases, The S-Procedure, The Function log°det, Path-Following Methods, How to Solve SDO Problems?, Icing on the Cake: Pattern Separation via Ellipsoids -- 8. Global Optimization: Branch and Bound Methods, Cutting Plane Methods -- Appendices: A Second Look at the Constraint Qualifications, The Fritz John Condition, Optimization Software Tools for Teaching and Learning -- Bibliography -- Index of Symbols -- Subject Index.
by Wilhelm Forst, Dieter Hoffmann.
Mathematics
Computer programming
Computer science
Mathematics
Algebra
Computer mathematics
Mathematical optimization
Mathematics
Optimization
Algebra
Programming Techniques
Symbolic and Algebraic Manipulation
Computational Mathematics and Numerical Analysis
Computational Science and Engineering
QA402.5-402.6
519.6
Springer eBooks
Springer Undergraduate Texts in Mathematics and Technology
9780387789774
http://dx.doi.org/10.1007/978-0-387-78977-4
http://dx.doi.org/10.1007/978-0-387-78977-4
100716
20180115171424.0
978-0-387-78977-4