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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
