Abstract

We propose an algorithm that produces a nondecreasing sequence of subsolutions for a class of optimal control problems distinguished by the property that the associated Bellman operators preserve convexity. In addition to a theoretical discussion and proofs of convergence, numerical experiments are presented to illustrate the feasibility of the method.

Full Text
Published version (Free)

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 call