Optimal Bounds for Numerical Approximations of Infinite Horizon Problems Based on Dynamic Programming Approach
From MaRDI portal
Publication:5883159
DOI10.1137/21M1459290MaRDI QIDQ5883159
Publication date: 29 March 2023
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.07371
Cites Work
- A numerical approach to the infinite horizon problem of deterministic control theory
- Comments on ``A numerical approach to the infinite horizon problem of deterministic control theory
- Corrigenda: A numerical approach to the infinite horizon problem of deterministic control theory
- An efficient algorithm for Hamilton-Jacobi equations in high dimension
- An adaptive sparse grid semi-Lagrangian scheme for first order Hamilton-Jacobi Bellman equations
- Feedback control of parametrized PDEs via model order reduction and dynamic programming principle
- Approximation of optimal feedback control: a dynamic programming approach
- Optimistic planning algorithms for state-constrained optimal control problems
- An Efficient Policy Iteration Algorithm for Dynamic Programming Equations
- The Max-Plus Finite Element Method for Solving Deterministic Optimal Control Problems: Basic Properties and Convergence Analysis
- On Deterministic Control Problems: An Approximation Procedure for the Optimal Cost I. The Stationary Problem
- Semi-Lagrangian Approximation Schemes for Linear and Hamilton—Jacobi Equations
- Error Analysis for POD Approximations of Infinite Horizon Problems via the Dynamic Programming Approach
- Optimal control and viscosity solutions of Hamilton-Jacobi-Bellman equations
This page was built for publication: Optimal Bounds for Numerical Approximations of Infinite Horizon Problems Based on Dynamic Programming Approach
