The Equivalence of Strong and Weak Formulations for Certain Problems in Optimal Control
Authors:
- Richard B. VinterRVRichard B. Vinter
- Richard M. LewisRLRichard M. Lewis
- 1 July 1978
- journal article
- research article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 16 (4) , 546-570
Abstract
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.Keywords
This publication has 8 references indexed in Scilit:
- A Necessary and Sufficient Condition for Optimality of Dynamic Programming Type, Making No a Priori Assumptions on the ControlsSIAM Journal on Control and Optimization, 1978
- An existence Theorem for Control Problems in Hilbert SpacesBulletin of the London Mathematical Society, 1977
- Extremal points and optimal control theoryAnnali di Matematica Pura ed Applicata (1923 -), 1976
- Deterministic and Stochastic Optimal Control1975
- Convex Analysis1970
- Relaxed Controls and Variational ProblemsSIAM Journal on Control, 1967
- Sufficient Conditions for Optimality and the Justification of the Dynamic Programming MethodSIAM Journal on Control, 1966
- Introdction to Measure and Probability1966