Reduction of dimensionality in dynamic programming via the method of diagonal decomposition
A new method of reducing the dimensionality associated with the solution of optimal control problems is introduced. The usual dynamic programming functional equation has a domain of dimension \(N\) where \(N\) is the dimension of the state sector describing the system. This functional equation is artificially decoupled into \(N\) functional equations with domains of dimension one which must be solved iteratively. The solutions are coupled by means of a pseudo-state equation which includes information about a previous guess at the optimal state trajectory in a known forcing term. Since the \(N\) functional equations are one-dimensional and since they may be solved sequentially rather than simultaneously the computational demands on rapid-access storage are dramatically reduced.
- scientific article; zbMATH DE number 4157350
- Dynamic programming, reduction of dimensionality and eigenvalue problems
- Reduced complexity dynamic programming based on policy iteration
- Reduction of dimensionality in choosing optimal control
- Application of dynamic programming to high-dimensional non-linear optimal control problems
- Reduction of dimensionality in dynamic programming-based solution methods for nonlinear integer programming
- Dynamic programming, reduction of dimensionality and eigenvalue problems
- Stability, prediction-correction, and dynamic programming
- A new algorithm for solving certain variational problems
- Symmetry reduction for dynamic programming
- Feasibility of DEIM for retrieving the initial field via dimensionality reduction
- Generalized dynamic programming: a variables freezing method
- The diagonal decomposition technique applied to the dynamic programming solution of elliptic partial differential equations
- Application of dynamic programming to high-dimensional non-linear optimal control problems
- scientific article; zbMATH DE number 4157350 (Why is no real title available?)
- scientific article; zbMATH DE number 915511 (Why is no real title available?)
- On the reduction of dimensionality for classes of dynamic programming processes
This page was built for publication: Reduction of dimensionality in dynamic programming via the method of diagonal decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2537025)
