## Article contents

# Turnpike in optimal control of PDEs, ResNets, and beyond

Published online by Cambridge University Press:
**09 June 2022**

## Abstract

The turnpike property in contemporary macroeconomics asserts that if an economic planner seeks to move an economy from one level of capital to another, then the most efficient path, as long as the planner has enough time, is to rapidly move stock to a level close to the optimal stationary or constant path, then allow for capital to develop along that path until the desired term is nearly reached, at which point the stock ought to be moved to the final target. Motivated in part by its nature as a resource allocation strategy, over the past decade, the turnpike property has also been shown to hold for several classes of partial differential equations arising in mechanics. When formalized mathematically, the turnpike theory corroborates insights from economics: for an optimal control problem set in a finite-time horizon, optimal controls and corresponding states are close (often exponentially) most of the time, except near the initial and final times, to the optimal control and the corresponding state for the associated stationary optimal control problem. In particular, the former are mostly constant over time. This fact provides a rigorous meaning to the asymptotic simplification that some optimal control problems appear to enjoy over long time intervals, allowing the consideration of the corresponding stationary problem for computing and applications. We review a slice of the theory developed over the past decade – the controllability of the underlying system is an important ingredient, and can even be used to devise simple turnpike-like strategies which are nearly optimal – and present several novel applications, including, among many others, the characterization of Hamilton–Jacobi–Bellman asymptotics, and stability estimates in deep learning via residual neural networks.

- Type
- Research Article
- Information
- Copyright
- © The Author(s), 2022. Published by Cambridge University Press

## Footnotes

Dedicated to the memory of Roland Glowinski

A major part of this work was completed while the author was affiliated with the Chair of Computational Mathematics, Fundación Deusto.

## References

*A Comprehensive Introduction to Sub-Riemannian Geometry*, Vol. 181 of Cambridge Studies in Advanced Mathematics, Cambridge University Press.Google Scholar

*Probab*. Theory Related Fields 178, 475–530.CrossRefGoogle Scholar

*Netw*. Heterog. Media 7, 279.CrossRefGoogle Scholar

*1-*$d$

*Flexible Multi-structures*, Vol. 50 of Mathématiques & Applications, Springer.Google Scholar

*I*ndiana Univ. Math. J. 55, 1671–1700.CrossRefGoogle Scholar

*Adv*. Geophys. 33, 141–266.Google Scholar

*Comm*. Partial Differential Equations 20, 335–356.CrossRefGoogle Scholar

*ATT Labs [Online]*. Available at http://yann.lecun.com/exdb/mnist.Google Scholar

*IEEE Trans. Automat. Control*. Available at doi:10.1109/TAC.2021.3096921.CrossRefGoogle Scholar

*Contrôlabilité Exacte, Perturbations et Stabilisation de Systèmes Distribués, Tome 1, Contrôlabilité Exacte*, Masson.Google Scholar

*Erge*. Math. Kolloq. 8, 73–83.Google Scholar

*Arch*. Ration. Mech. Anal. 45, 321–351.CrossRefGoogle Scholar

- 9
- Cited by