# An Optimal Control Theory for Accelerated Optimization

arXiv: https://arxiv.org/abs/1902.09004 · HTML: https://mlsanity.com/paper/1902.09004/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 24 Feb 2019.

## Built on by (most cited first, 3 of 3)

- [A Derivation of Nesterov's Accelerated Gradient Algorithm from Optimal Control Theory](https://mlsanity.com/paper/2203.17226/) (2022)
- [On The Mathematics of the Natural Physics of Optimization](https://mlsanity.com/paper/2604.17645/) (2026)
- [Maximum Tsallis Entropy Distributions for Robust and Efficient Sparse Learning from Correlated Data](https://mlsanity.com/paper/2608.17244/) (2026)

## Abstract (arXiv)

The first-order optimality conditions for a generic nonlinear optimization problem are generated as part of the terminal transversality conditions of an optimal control problem. It is shown that the Lagrangian of the optimization problem is connected to the Hamiltonian of the optimal control problem via a zero-Hamiltonian, infinite-order, singular arc. The necessary conditions for the singular optimal control problem are used to produce an auxiliary controllable dynamical system whose trajectories generate algorithm primitives for the optimization problem. A three-step iterative map for a generic algorithm is designed by a semi-discretization step. Neither the feedback control law nor the differential equation governing the algorithm need be derived explicitly. A search direction is produced by a proximal-aiming-type method that dissipates a control Lyapunov function. New step size procedures based on minimizing control Lyapunov functions along a search vector complete the design of the accelerated algorithms.