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)

• Line Search.- Newton’s Methods.- Conjugate Gradient Method.- Quasi-Newton Methods.- Trust-Region Methods and Conic Model Methods.- Solving Nonlinear Least-Squares Problems.- Theory of Constrained Optimization.- Quadratic Programming.- Penalty Function Methods.- Feasible Direction Methods.- Sequential Quadratic Programming.- Trust-Region Methods for Constrained Problems.- Nonsmooth Optimization.

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)

• Line Search.- Newton’s Methods.- Conjugate Gradient Method.- Quasi-Newton Methods.- Trust-Region Methods and Conic Model Methods.- Solving Nonlinear Least-Squares Problems.- Theory of Constrained Optimization.- Quadratic Programming.- Penalty Function Methods.- Feasible Direction Methods.- Sequential Quadratic Programming.- Trust-Region Methods for Constrained Problems.- Nonsmooth Optimization.

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)

• Line Search.- Newton’s Methods.- Conjugate Gradient Method.- Quasi-Newton Methods.- Trust-Region Methods and Conic Model Methods.- Solving Nonlinear Least-Squares Problems.- Theory of Constrained Optimization.- Quadratic Programming.- Penalty Function Methods.- Feasible Direction Methods.- Sequential Quadratic Programming.- Trust-Region Methods for Constrained Problems.- Nonsmooth Optimization.