Work

Adaptive aggregation methods for discounted dynamic programming

Year: 1986
Type: conference-paper
Abstract: We propose a class of iterative aggregation algorithms for solving discounted dynamic programming problems. The idea is to interject aggregation iterations in the course of the usual successive approximation method. An important new feature that sets our method apart from earlier proposals is that the aggregate groups of states change adaptively from one aggregation iteration to the next, depending on the progress of the computation. This allows acceleration of convergence in difficult problems involving multiple ergodic classes for which methods using fixed groups of aggregate states are ineffective. No knowledge of special problem structure is utilized by the algorithms.
Language: English
Open Access status: green
OpenAlex ID: W2014604517
FWCI: 0.548
Cites: 8
Cited by: 4
Related to: 10