This book gives an overview of the dramatic reorganization that has occurred during the last decade in one area of mathematical programming and numerical computation: algorithmic differentiable optimization and equation-solving, or, more simply, algorithmic differentiable programming. The reader is assumed to be familiar with advanced calculus, numerical analysis, the theory and algorithms of linear and nonlinear programming, and the fundamentals of computer science. Thus, this monograph is intended for researchers in optimization and advanced graduate students. But others will find the ideas to be of interest as well.

Includes supplementary material: sn.pub/extras

Inhalt
Foundations.- The Karmarkar Revolution.- The Newton-Cauchy Method.- Euler-Newton and Lagrange-NC Methods.- Lessons from One Dimension.- A Misleading Paradigm.- CG and the Line Search.- Gilding the NelderMead Lily.- Choosing the Right Diagonal Scale.- Historical Parallels.- LP from the Newton-Cauchy Perspective.- Diagonal Metrics and the QC Method.- Linear Programming Post-Karmarkar.- LP from the Euler-Newton Perspective.- Log-Barrier Transformations.- Karmarkar Potentials and Algorithms.- Algorithmic Science.- Algorithmic Principles.- Multialgorithms: A New Paradigm.- An Emerging Discipline.