A rigorous and unusually well-balanced treatment of nonlinear programming that joins theory, computation, and application without losing sight of the reader.
Richard Murdoch Montgomery has written the sort of technical book I wish more authors in optimisation would attempt and fewer would overclaim. This is not just a catalogue of methods; it is a carefully built account of nonlinear programming as a living discipline, moving from the mathematical foundations to algorithmic design and then into practical computation and modern use cases. I found its greatest strength to be its seriousness of purpose: the arguments are laid out with discipline, the notation is consistent, and the exposition feels independently checked rather than assembled from recycled textbook fragments.
What distinguishes the book most is the way it keeps theory and practice in conversation. Too many texts on optimisation either stay safely in convex abstraction or race ahead into software without explaining why the methods work. Montgomery does neither. He gives the reader enough structure to understand constraint handling, convergence, and algorithmic trade-offs, while also showing how those ideas behave when implemented in real computational settings. That balance makes the book especially valuable for readers who need more than a formal sketch but less than a research monograph.
I also appreciated the book’s breadth of ambition. The subtitle is not decorative: it really does engage with theory, algorithms, computation, and contemporary applications as a coherent whole. In a field where the temptation is often to privilege elegant proofs over messy reality, Montgomery is attentive to the compromises that numerical work demands — stability, efficiency, scaling, and the human cost of opaque tools that can be hard to trust. The result is a text that feels modern without chasing novelty for its own sake.
If I have one small caveat, it is that the very thoroughness that gives the book its authority can occasionally slow the pace for readers coming in cold. But this is a minor complaint, and in practice it is the price of precision. For graduate students, researchers, and practitioners who want a dependable guide to nonlinear programming, this is a notably strong and carefully made book.
Who should read this
I would recommend it to graduate students in optimisation, researchers in applied mathematics and computer science, and engineers who need a serious reference rather than a simplified introduction. It is especially useful for readers who want to understand not only how nonlinear programming methods are used, but why they are shaped the way they are.
A personal note from Chen
I came away impressed by its steadiness: no flourish for its own sake, no loose ends, just a well-judged, intelligently organised book that earns the reader’s trust.
Conversation(0)
Join in — no account needed. A name and email are all it takes. Your email is never shown publicly.