Beschreibung:
An overview of the dramatic reorganization in reaction to N. Karmakar's seminal 1984 paper on algorithmic linear programming in the area of algorithmic differentiable optimization and equation-solving, or, more simply, algorithmic differentiable programming. Aimed at readers familiar with advanced calculus and numerical analysis.
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 Nelder-Mead 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.