The Equivalence of Strong and Weak Formulations for Certain Problems in Optimal Control

DOI10.1137/0316037zbMath0396.49011OpenAlexW1978873681MaRDI QIDQ4179449

R. M. Lewis, Richard B. Vinter

Publication date: 1978

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0316037

zbMATH Keywords

Bellman EquationConditions for Optimality of Dynamic Programming TypeConvex AnalysisConvex Mathematical Programming ProblemsPartial Differential InequalityRelaxed Control ProblemSpace of Radon MeasuresWeak Problem

Mathematics Subject Classification ID

Variational inequalities (49J40) Dynamic programming in optimal control and differential games (49L20) Optimality conditions for problems involving ordinary differential equations (49K15) Existence theories in calculus of variations and optimal control (49J99)

Related Items

Linear Conic Optimization for Inverse Optimal Control, A supporting hyperplane derivation of the Hamilton-Jacobi-Bellman equation of dynamic programming, Relaxation of optimal control problems to equivalent convex programs, Modal occupation measures and LMI relaxations for nonlinear switched systems control, Semi-definite relaxations for optimal control problems with oscillation and concentration effects, Computing Controlled Invariant Sets from Data Using Convex Optimization, Bounding Extreme Events in Nonlinear Dynamics Using Convex Optimization, Optimal control of piecewise deterministic markov process, Convex duality for finite-fuel problems in singular stochastic control, Controller design and value function approximation for nonlinear dynamical systems