Complexity reduction, cornices and pruning

MaRDI QIDQ3181769zbMATH OpenFDO

Authors William M. Mceneaney

Publication date 12 October 2009

zbMATH Keywords

curse-of-dimensionalitymax-plus idempotent

Mathematics Subject Classification ID

Dynamic programming in optimal control and differential games (49L20) Convex functions and convex programs in convex geometry (52A41) Computational aspects related to convexity (52B55) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Convergence rate for a curse-of-dimensionality-free method for Hamilton-Jacobi-Bellman PDEs represented as maxima of quadratic forms
• min-max spaces and complexity reduction in min-max expansions
• Contraction of Riccati flows applied to the convergence analysis of a max-plus curse-of-dimensionality-free method
• Payoff suboptimality and errors in value induced by approximation of the Hamiltonian
• Max-plus summation of Fenchel-transformed semigroups for solution of nonlinear Bellman equations

Cited in

(6)

• Sparse approximate solutions to max-plus equations
• Sparsity in max-plus algebra and systems
• Maximizing concave piecewise affine functions on the unitary group
• Idempotent expansions for continuous-time stochastic control
• min-max spaces and complexity reduction in min-max expansions
• Distributed dynamic programming for discrete-time stochastic control, and idempotent algorithms

This page was built for publication: Complexity reduction, cornices and pruning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3181769)