Sub-optimal control by primal-dual gradient dynamics
Abstract
This note generalizes the port-Hamiltonian formulation of the continuous time primal-dual gradient algorithm for static constrained convex optimization to the convex optimal control problem.The resulting dynamics is shown to be a port-Hamiltonian system of partial differential equations, involving ordinary physical time as well 'algorithmic' time. Convergence to the optimal control solution is indicated, and it is argued that sub-optimal control strategies could be derived starting from the partial differential equation formulation.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.