Polynomial Approximation--A New Computational Technique in Dynamic Programming: Allocation Processes

From MaRDI portal
Revision as of 05:55, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5736649

DOI10.2307/2003635zbMath0123.37303OpenAlexW4230447275MaRDI QIDQ5736649

Richard Bellman, Bella Kotkin, Robert E. Kalaba

Publication date: 1963

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2003635




Related Items (21)

Richard Bellman's contributions to computer scienceDynamic programming approximation algorithms for the capacitated lot-sizing problemFunctional equations in the theory of dynamic programming. XII: An application of the maximum transformHybrid functions of Bernstein polynomials and block-pulse functions for solving optimal control of the nonlinear Volterra integral equationsLow-discrepancy sampling for approximate dynamic programming with local approximatorsA comparison of global and semi-local approximation in \(T\)-stage stochastic optimizationOptimized ensemble value function approximation for dynamic programmingUnnamed ItemDynamic programming and value-function approximation in sequential decision problems: error analysis and numerical resultsWater reservoir control under economic, social and environmental constraintsA unified framework for stochastic optimizationApproximate dynamic programming for stochastic \(N\)-stage optimization with application to optimal consumption under uncertaintyUnnamed ItemEfficient sampling in approximate dynamic programming algorithmsShape-preserving computation in economic growth modelsManagement of water resource systems in the presence of uncertainties by nonlinear approximation techniques and deterministic samplingSplines and efficiency in dynamic programmingSuboptimal Policies for Stochastic $$N$$-Stage Optimization: Accuracy Analysis and a Case Study from Optimal ConsumptionUnnamed ItemA simulation-based approach to stochastic dynamic programmingGeneralized polynomial approximations in Markovian decision processes




This page was built for publication: Polynomial Approximation--A New Computational Technique in Dynamic Programming: Allocation Processes