Splitting Enables Overcoming the Curse of Dimensionality
algorithmdifferential gamesHamilton-Jacobi initial value problemlevel set methodlinear programmingnonconvex Hamiltoniansnumerical examplesoptimal control
Hamilton-Jacobi equations (35F21) Existence theories for optimal control problems involving partial differential equations (49J20) Discrete approximations in optimal control (49M25) Numerical optimization and variational techniques (65K10) Numerical methods for Hamiltonian systems including symplectic integrators (65P10) Linear programming (90C05) Differential games (aspects of game theory) (91A23)
- Breaking the curse of dimensionality
- scientific article; zbMATH DE number 2237872
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- A split-and-conquer approach for analysis of
- Using Randomization to Break the Curse of Dimensionality
- Separation dimension and sparsity
- A unifying splitting framework
- An efficient algorithm for Hamilton-Jacobi equations in high dimension
- Algorithm for overcoming the curse of dimensionality for certain non-convex Hamilton-Jacobi equations, projections and differential games
- Algorithms for overcoming the curse of dimensionality for certain Hamilton-Jacobi equations arising in control theory and elsewhere
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- Error Estimates for a Tree Structure Algorithm Solving Finite Horizon Control Problems
- A splitting method for overcoming the curse of dimensionality in Hamilton-Jacobi equations arising from nonlinear optimal control and differential games with applications to trajectory generation
This page was built for publication: Splitting Enables Overcoming the Curse of Dimensionality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5350484)