Abstract
A new class of iterative algorithms for solving undiscounted Bellman equations is proposed in this article, Such algorithms are proved to be particularly useful in handling “degenerate” equations. For simplicity of presentation and for motivation of basic ideas, the algorithms are introduced in terms of three control problems, one optimal stopping time problem and two singular stochastic control problems. The convergence and rates of convergence are obtained. These results are based on the introduction of a performance index of approximation, which makes new algorithms differ from the existing ones for solving regular undiscounted Bellman equations in the control literature.
Sign-in/Register to access full text options 
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.
