Domain decomposition based parallel Howard's algorithm

DOI10.1016/j.matcom.2017.04.008OpenAlexW1915316363MaRDI QIDQ1997066

Adriano Festa

Publication date: 1 March 2021

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.5044

zbMATH Keywords

domain decompositionparallel computingHoward's algorithm (policy iterations)

Mathematics Subject Classification ID

Numerical analysis (65-XX) Computer science (68-XX)

Related Items (3)

Error Estimates for a Tree Structure Algorithm Solving Finite Horizon Control Problems ⋮ Optimal route planning for sailing boats: a hybrid formulation ⋮ An Efficient DP Algorithm on a Tree-Structure for Finite Horizon Optimal Control Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Flow invariance on stratified domains
• Approximation schemes for viscosity solutions of Hamilton-Jacobi equations
• A discontinuous Galerkin finite element method for directly solving the Hamilton-Jacobi equations
• Systems of convex Hamilton-Jacobi equations with implicit obstacles and the obstacle problem
• A splitting algorithm for Hamilton-Jacobi-Bellman equations
• A new domain decomposition method for an HJB equation.
• Advances in dynamic games. Applications to economics, finance, optimization and stochastic control.
• A nonsmooth version of Newton's method
• Reconstruction of independent sub-domains for a class of Hamilton–Jacobi equations and application to parallel computing
• A Bellman approach for two-domains optimal control problems in ℝ^N
• A Bellman Approach for Regional Optimal Control Problems in $\mathbb{R}^N$
• Two Approximations of Solutions of Hamilton-Jacobi Equations
• An Efficient Policy Iteration Algorithm for Dynamic Programming Equations
• Some Convergence Results for Howard's Algorithm
• Optimal Control with State-Space Constraint I
• Numerical Stabilization of Bilinear Control Systems
• On the Convergence of Policy Iteration in Stationary Dynamic Programming
• Domain decomposition algorithms for solving hamilton-jacobi-bellman equations
• Ordered Upwind Methods for Static Hamilton--Jacobi Equations: Theory and Algorithms
• Convergence Properties of Policy Iteration
• A fast sweeping method for Eikonal equations
• A Patchy Dynamic Programming Scheme for a Class of Hamilton--Jacobi--Bellman Equations
• Optimal control and viscosity solutions of Hamilton-Jacobi-Bellman equations

This page was built for publication: Domain decomposition based parallel Howard's algorithm