Relaxation of optimal control problems to equivalent convex programs

DOI10.1016/0022-247X(80)90143-2zbMath0443.49015MaRDI QIDQ1144262

R. M. Lewis, Richard B. Vinter

Publication date: 1980

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

convexitydynamic programming typerelaxation of optimal control problems

Mathematics Subject Classification ID

Convex programming (90C25) Methods involving semicontinuity and convergence; relaxation (49J45) Existence theories for optimal control problems involving ordinary differential equations (49J15) Optimality conditions for problems involving ordinary differential equations (49K15)

Related Items (9)

Linear programming fictitious play algorithm for mean field games with optimal stopping and absorption ⋮ A supporting hyperplane derivation of the Hamilton-Jacobi-Bellman equation of dynamic programming ⋮ Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 ⋮ Unnamed Item ⋮ Computing Controlled Invariant Sets from Data Using Convex Optimization ⋮ Bounding Extreme Events in Nonlinear Dynamics Using Convex Optimization ⋮ Control and optimal stopping mean field games: a linear programming approach ⋮ On some generalization of bang-bang control ⋮ The large time profile for Hamilton-Jacobi-Bellman equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A supporting hyperplane derivation of the Hamilton-Jacobi-Bellman equation of dynamic programming
• Extremal points and optimal control theory
• On sensitivity in an optimal control problem
• Generalized surfaces in the calculus of variations
• Generalized Curves and Extremal Points
• New Representation Theorems for Consistent Flows
• A Necessary and Sufficient Condition for Optimality of Dynamic Programming Type, Making No a Priori Assumptions on the Controls
• The Equivalence of Strong and Weak Formulations for Certain Problems in Optimal Control
• Sufficient Conditions for Optimality and the Justification of the Dynamic Programming Method
• Relaxed Controls and Variational Problems

This page was built for publication: Relaxation of optimal control problems to equivalent convex programs