Proximal algorithms and temporal difference methods for solving fixed point problems
Abstract In this paper we consider large fixed point problems and solution with proximal algorithms. We show that for linear problems there is a close connection between proximal iterations, which are prominent in numerical analysis and optimization, and multistep methods of the tempo...
Main Author: | Bertsekas, Dimitri P |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | English |
Published: |
Springer US
2021
|
Online Access: | https://hdl.handle.net/1721.1/131865 |
Similar Items
-
A unified framework for temporal difference methods
by: Bertsekas, Dimitri P.
Published: (2010) -
Pathologies of Temporal Difference Methods in Approximate Dynamic Programming
by: Bertsekas, Dimitri P.
Published: (2011) -
Incremental proximal methods for large scale convex optimization
by: Bertsekas, Dimitri P.
Published: (2012) -
On a proximal point algorithm for solving common fixed point problems and convex minimization problems in Geodesic spaces with positive curvature
by: Chainarong Khunpanuk, et al.
Published: (2022-03-01) -
Convergence Results for Some Temporal Difference Methods Based on Least Squares
by: Yu, Huizhen, et al.
Published: (2012)