# An algorithm to construct subsolutions of convex optimal control problems

@inproceedings{Bet2021AnAT, title={An algorithm to construct subsolutions of convex optimal control problems}, author={G. Bet and Markus Fischer}, year={2021} }

We propose an algorithm that produces a non-decreasing 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. MSC2020 subject classifications: (Primary) 90C39, 93E20, (Secondary) 49L20, 49M25.

#### References

SHOWING 1-10 OF 21 REFERENCES

An Iterative Procedure for Constructing Subsolutions of Discrete-Time Optimal Control Problems

- Mathematics, Computer Science
- SIAM J. Control. Optim.
- 2011

Numerical aspects of monotone approximations in convex stochastic control problems

- Mathematics, Computer Science
- Ann. Oper. Res.
- 1995

Numerical Methods for Nonlinear Optimal Control Problems

- Mathematics, Computer Science
- Encyclopedia of Systems and Control
- 2015

Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations

- Mathematics, Computer Science
- SIAM J. Control. Optim.
- 2008

Regression Methods for Stochastic Control Problems and Their Convergence Analysis

- Mathematics, Computer Science
- SIAM J. Control. Optim.
- 2010