Suboptimal Policies for Stochastic $$N$$-Stage Optimization: Accuracy Analysis and a Case Study from Optimal Consumption
From MaRDI portal
Publication:4979399
DOI10.1007/978-3-319-00669-7_3zbMath1291.90286OpenAlexW2097546484WikidataQ59403933 ScholiaQ59403933MaRDI QIDQ4979399
Giorgio Gnecco, Mauro Gaggero, Marcello Sanguineti
Publication date: 20 June 2014
Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-00669-7_3
Related Items (1)
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
- Suboptimal solutions to dynamic optimization problems via approximations of the policy functions
- Approximation schemes for functional optimization problems
- Characterization of optimal plans for stochastic dynamic programs
- Generalized bounds for convex multistage stochastic programs.
- Dynamic programming and value-function approximation in sequential decision problems: error analysis and numerical results
- Efficient sampling in approximate dynamic programming algorithms
- An envelope theorem and some applications to discounted Markov decision processes
- Applying Experimental Design and Regression Splines to High-Dimensional Continuous-State Stochastic Dynamic Programming
- Commentary—Perspectives on Stochastic Optimization Over Time
- Suboptimal Solutions to Team Optimization Problems with Stochastic Information Structure
- Approximate Minimization of the Regularized Expected Error over Kernel Models
- Functional Approximations and Dynamic Programming
- On the exponential convergence of matching pursuits in quasi-incoherent dictionaries
- Geometric Upper Bounds on Rates of Variable-Basis Approximation
- Improved Dynamic Programming Methods for Optimal Control of Lumped-Parameter Stochastic Systems
- Numerical Solution of Continuous-State Dynamic Programs Using Linear and Spline Interpolation
- Approximation Schemes for Infinite Linear Programs
- Smoothness of the Policy Function in Discrete Time Economic Models
- 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
- Polynomial Approximation--A New Computational Technique in Dynamic Programming: Allocation Processes
- Approximation by superpositions of a sigmoidal function
- Approximating networks and extended Ritz method for the solution of functional optimization problems
This page was built for publication: Suboptimal Policies for Stochastic $$N$$-Stage Optimization: Accuracy Analysis and a Case Study from Optimal Consumption