Suboptimal solutions to dynamic optimization problems via approximations of the policy functions
From MaRDI portal
Publication:613579
DOI10.1007/s10957-010-9680-7zbMath1254.90285OpenAlexW2124109858MaRDI QIDQ613579
Giorgio Gnecco, Marcello Sanguineti
Publication date: 21 December 2010
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-010-9680-7
dynamic programmingdynamic optimizationapproximation schemescurse of dimensionalitysuboptimal policies
Related Items
On the curse of dimensionality in the Ritz method ⋮ Welfare and research and development incentive effects of uniform and differential pricing schemes ⋮ Suboptimal control for nonlinear systems with disturbance via integral sliding mode control and policy iteration ⋮ A comparison between fixed-basis and variable-basis schemes for function approximation and functional optimization ⋮ Dynamic programming and value-function approximation in sequential decision problems: error analysis and numerical results ⋮ LQG Online Learning ⋮ Approximate dynamic programming for stochastic \(N\)-stage optimization with application to optimal consumption under uncertainty ⋮ Functional optimization by variable-basis approximation schemes ⋮ Estimates of variation with respect to a set and applications to optimization problems ⋮ An intrinsic material tailoring approach for functionally graded axisymmetric hollow bodies under plane elasticity ⋮ A Comparison of Game-Theoretic Models for Parallel Trade ⋮ Suboptimal Policies for Stochastic $$N$$-Stage Optimization: Accuracy Analysis and a Case Study from Optimal Consumption
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the tractability of multivariate integration and approximation by neural networks
- Complexity of Gaussian-radial-basis networks approximating smooth functions
- Estimates of the approximation error using Rademacher complexity: Learning vector-valued functions
- Approximation schemes for functional optimization problems
- On the approximation of infinite optimization problems with an application to optimal control problems
- Lipschitz continuous policy functions for strongly concave optimization problems
- Lectures on analysis on metric spaces
- Nonlinear black-box models in system identification: Mathematical foundations
- Approximate Minimization of the Regularized Expected Error over Kernel Models
- Geometric Upper Bounds on Rates of Variable-Basis Approximation
- Value and Policy Function Approximations in Infinite-Horizon Optimization Problems
- The Once But Not Twice Differentiability of the Policy Function
- Degree of Approximation Results for Feedforward Networks Approximating Unknown Mappings and Their Derivatives
- Radial Basis Functions
- Comparison of worst case errors in linear and neural network approximation
- Approximate Dynamic Programming
- Error Estimates for Approximate Optimization by the Extended Ritz Method
- Error bounds for approximation with neural networks
- Approximating networks and extended Ritz method for the solution of functional optimization problems
