A Curse-of-Dimensionality-Free Numerical Method for Solution of Certain HJB PDEs
From MaRDI portal
Publication:3516077
Recommendations
- Convergence rate for a curse-of-dimensionality-free method for Hamilton-Jacobi-Bellman PDEs represented as maxima of quadratic forms
- Convergence rate for a curse-of-dimensionality-free method for a class of HJB PDEs
- Algorithm for overcoming the curse of dimensionality for state-dependent Hamilton-Jacobi equations
- Max-plus summation of Fenchel-transformed semigroups for solution of nonlinear Bellman equations
- Payoff suboptimality and errors in value induced by approximation of the Hamiltonian
Cited in
(40)- Perspectives on characteristics based curse-of-dimensionality-free numerical approaches for solving Hamilton-Jacobi equations
- An improved method for approximating the infinite-horizon value function of the discrete-time switched LQR problem
- A convergent hierarchy of non-linear eigenproblems to compute the joint spectral radius of nonnegative matrices
- Tensor decomposition methods for high-dimensional Hamilton-Jacobi-Bellman equations
- Approximation of optimal control surfaces for \(2\times 2\) skew-symmetric evolutionary game dynamics
- Maximizing concave piecewise affine functions on the unitary group
- Stochastic differential games: a sampling approach via FBSDEs
- Max-plus methods for nonlinear control and estimation.
- Lax-Oleinik-type formulas and efficient algorithms for certain high-dimensional optimal control problems
- Tropical reproducing kernels and optimization
- A new fundamental solution for differential Riccati equations arising in control
- A reduced complexity MIN-plus solution method to the optimal control of closed quantum systems
- Overcoming the curse of dimensionality in the numerical approximation of Allen-Cahn partial differential equations via truncated full-history recursive multilevel Picard approximations
- On some neural network architectures that can represent viscosity solutions of certain high dimensional Hamilton-Jacobi partial differential equations
- Certification of real inequalities: templates and sums of squares
- Approximate dynamic programming via iterated Bellman inequalities
- A differential game theoretic approach for two-agent collision avoidance with travel limitations
- Max-plus summation of Fenchel-transformed semigroups for solution of nonlinear Bellman equations
- Idempotent expansions for continuous-time stochastic control
- Connecting Hamilton-Jacobi partial differential equations with maximum a posteriori and posterior mean estimators for some non-convex priors
- Data-Driven Tensor Train Gradient Cross Approximation for Hamilton–Jacobi–Bellman Equations
- scientific article; zbMATH DE number 7370565 (Why is no real title available?)
- Distributed dynamic programming for discrete-time stochastic control, and idempotent algorithms
- Neural network architectures using min-plus algebra for solving certain high-dimensional optimal control problems and Hamilton-Jacobi PDEs
- Convergence rate for a curse-of-dimensionality-free method for a class of HJB PDEs
- Convergence rate for a curse-of-dimensionality-free method for Hamilton-Jacobi-Bellman PDEs represented as maxima of quadratic forms
- A tree structure approach to reachability analysis
- Contraction of Riccati flows applied to the convergence analysis of a max-plus curse-of-dimensionality-free method
- The contraction rate in Thompson's part metric of order-preserving flows on a cone -- application to generalized Riccati equations
- A multilinear HJB-POD method for the optimal control of PDEs on a tree structure
- Optimal dual adaptive agile mobile wireless power control
- A multilevel fast marching method for the minimum time problem
- Dynamic programming and viscosity solutions for the optimal control of quantum spin systems
- Overcoming the curse of dimensionality for some Hamilton-Jacobi partial differential equations via neural network architectures
- A max-plus based fundamental solution for a class of discrete time linear regulator problems
- SympOCnet: Solving Optimal Control Problems with Applications to High-Dimensional Multiagent Path Planning Problems
- Error Estimates for a Tree Structure Algorithm Solving Finite Horizon Control Problems
- HJB-RBF based approach for the control of PDEs
- Payoff suboptimality and errors in value induced by approximation of the Hamiltonian
- Stochastic optimal control via forward and backward stochastic differential equations and importance sampling
This page was built for publication: A Curse-of-Dimensionality-Free Numerical Method for Solution of Certain HJB PDEs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3516077)