From the reviews:
„The book contains a comprehensive presentation of methods for unconstrained and constrained optimization problems. … The main strength of the book is the precise convergence analysis of most nonlinear programming algorithms presented, and it is especially comprehensive for line search, Newton, quasi-Newton, trust region and SQP methods. In this respect the book is a very valuable reference.“ (Darinka Dentcheva, Mathematical Reviews, Issue 2007 c)
„Optimization is a subject that is widely and increasingly used in science, engineering, economics, management, industry, and other areas. … The book is self-contained, systematic in theory and algorithms, and easy to read. … The book also contains an extensive … bibliography with 366 references, which is an important part of the book, and is useful to readers for further studies. Each chapter ends with an exercise set.“ (Alexandr B. Vasil’ev, Zentralblatt MATH, Vol. 1129 (7), 2008)
This book, a result of the authors’ teaching and research experience in various universities and institutes over the past ten years, can be used as a textbook for an optimization course for graduates and senior undergraduates. It systematically describes optimization theory and several powerful methods, including recent results. For most methods, the authors discuss an idea’s motivation, study the derivation, establish the global and local convergence, describe algorithmic steps, and discuss the numerical performance. The book deals with both theory and algorithms of optimization concurrently. It also contains an extensive bibliography. Finally, apart from its use for teaching, Optimization Theory and Methods will be very useful as a research reference.
