Discrete time dynamic programming using tensor trains
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- A continuous analogue of the tensor-train decomposition
- A kernel-based approximate dynamic programming approach: theory and application
- A new method for the nonlinear transformation of means and covariances in filters and estimators
- Active fault detection and control: unified formulation and optimal design
- Approximate dynamic programming. Solving the curses of dimensionality
- Approximating optimal feedback controllers of finite horizon control problems using hierarchical tensor formats
- Approximative policy iteration for exit time feedback control problems driven by stochastic differential equations using tensor train format
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- Computational suite of models with heterogeneous agents II: multi-country real business cycle models
- Data-Driven Tensor Train Gradient Cross Approximation for Hamilton–Jacobi–Bellman Equations
- Decentralized and distributed active fault diagnosis: multiple model estimation algorithms
- Hierarchical tensor approximation of output quantities of parameter-dependent PDEs
- How to find a good submatrix
- Incomplete cross approximation in the mosaic-skeleton method
- Low-rank tensor structure of linear diffusion operators in the TT and QTT formats
- On the continuity of the Bellman function in an optimal control problem with monotone dynamics
- Optimal control
- Policy search for active fault diagnosis with partially observable state
- Quasioptimality of maximum-volume cross interpolation of tensors
- Sufficient statistics in the optimum control of stochastic systems
- TT-cross approximation for multidimensional arrays
- Tensor decomposition methods for high-dimensional Hamilton-Jacobi-Bellman equations
- Tensor-train decomposition
- The alternating linear scheme for tensor optimization in the tensor train format
- The maximal-volume concept in approximation by low-rank matrices
- Two-level QTT-Tucker format for optimized tensor calculus
- Variants of alternating least squares tensor completion in the tensor train format
This page was built for publication: Discrete time dynamic programming using tensor trains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6905873)
