Error Bounds for Approximations from Projected Linear Equations

From MaRDI portal

Revision as of 21:55, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3169095

Jump to:navigation, search

DOI10.1287/moor.1100.0441zbMath1218.90211OpenAlexW2140778663MaRDI QIDQ3169095

Dimitri P. Bertsekas, Huizhen Yu

Publication date: 27 April 2011

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.1100.0441

zbMATH Keywords

dynamic programming error bounds Galerkin methods temporal difference methods function approximation projected linear equations

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Markov and semi-Markov decision processes (90C40) Approximation by arbitrary linear expressions (41A45)

Related Items (4)

Approximate policy iteration: a survey and some new methods ⋮ On Generalized Bellman Equations and Temporal-Difference Learning ⋮ Proximal algorithms and temporal difference methods for solving fixed point problems ⋮ Off-policy temporal difference learning with distribution adaptation in fast mixing chains

This page was built for publication: Error Bounds for Approximations from Projected Linear Equations

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3169095&oldid=16275688"