Presents recent developments of key topics in nonlinear programming using a logical and self-contained format. Divided into three sections that deal with convex analysis, optimality conditions and duality, computational techniques. Precise statements of algorithms are given along with convergence analysis. Each chapter contains detailed numerical examples, graphical illustrations and numerous exercises to aid readers in understanding the concepts and methods discussed.
This book is exceptionally dry. I think the content is good from a collection standpoint, but the whole thing is hard to follow as it lacks a central narrative. It's just theorem after theorem with proofs in between each.