
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
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.
This book explores the fundamental algorithms and advanced techniques of numerical optimization, grounded in real-world examples. It aims to provide a tutorial exposition of methods such as Newtonian approaches, line-searches, trust-region methods, and sequential quadratic programming, alongside more specialized algorithms like nonsmooth optimization, decomposition techniques, and interior-point methods. The text details these algorithms to facilitate straightforward implementation, while carefully addressing theoretical aspects with minimal assumptions. The revised edition includes substantial updates, such as a new section on quadratic programming in Part I and a reorganized, expanded Part II on nonsmooth optimization, complemented by computational exercises to enhance practical understanding.
The book is structured to guide readers through numerical optimization techniques, starting with accessible examples and progressing to advanced topics. The inclusion of computational exercises suggests a focus on practical application and implementation, aiming to deepen the reader's understanding of how algorithms function and how to address potential challenges. The revisions in the second edition indicate an effort to keep the content current and comprehensive, particularly in the areas of nonsmooth optimization and quadratic programming. This detailed approach, balancing theory with practical considerations, positions the book as a valuable resource for those seeking to master numerical optimization.
Page Count:
437
Publication Date:
2003-01-01
ISBN-10:
3540001913
ISBN-13:
9783540001911
No comments yet. Be the first to share your thoughts!