
doi: 10.1137/0316037
It is shown that a wide class of control problems may be cast equivalently as convex mathematical programming problems over a space of Radon measures. The particularly simple structure of the equivalent problems will enable us to obtain new conditions for optimality, of dynamic programming type, by application of convex analysis. These implications are pursued in a companion paper.
Relaxed Control Problem, Partial Differential Inequality, Weak Problem, Dynamic programming in optimal control and differential games, Existence theories in calculus of variations and optimal control, Variational inequalities, Optimality conditions for problems involving ordinary differential equations, Space of Radon Measures, Conditions for Optimality of Dynamic Programming Type, Convex Mathematical Programming Problems, Bellman Equation, Convex Analysis
Relaxed Control Problem, Partial Differential Inequality, Weak Problem, Dynamic programming in optimal control and differential games, Existence theories in calculus of variations and optimal control, Variational inequalities, Optimality conditions for problems involving ordinary differential equations, Space of Radon Measures, Conditions for Optimality of Dynamic Programming Type, Convex Mathematical Programming Problems, Bellman Equation, Convex Analysis
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 31 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 1% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
