REVIEW 3 cited by
Turnpike in optimal control and beyond: a survey
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
The turnpike principle is a fundamental concept in optimal control theory, stating that for a wide class of long-horizon optimal control problems, the optimal trajectory spends most of its time near a steady-state solution (the ''turnpike'') rather than being influenced by the initial or final conditions. In this article, we provide a survey on the turnpike property in optimal control, adding several recent and novel considerations. After some historical insights, we present an elementary proof of the exponential turnpike property for linear-quadratic optimal control problems in finite dimension. Next, we show an extension to nonlinear optimal control problems, with a local exponential turnpike property. On simple but meaningful examples, we illustrate the local and global aspects of the turnpike theory, clarifying the global picture and raising new questions. We discuss key generalizations, in infinite dimension and other various settings, and review several applications of the turnpike theory across different fields.
Forward citations
Cited by 3 Pith papers
-
Optimal control of symmetry-breaking dynamics near criticality
Near a pitchfork bifurcation, optimal control reduces to one of three universal normal forms selected by the cost scaling, with closed-form laws in the intermediate and weak regimes.
-
Long-time behavior and turnpike properties of linear-quadratic graphon mean field control problems
Finite-horizon optimal pairs in linear-quadratic graphon mean field control converge exponentially to the ergodic optimal pair away from time boundaries.
-
A Multi-Objective Optimization framework for Decentralized Learning with coordination constraints
A weighted-sum scalarization of agent and coordinator objectives yields a FedAvg-like decentralized algorithm with O(1/sqrt(T)) convergence under convexity and bounded heterogeneity.
Discussion (0). Continue with ORCID to comment.