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...
| Autor Principal: | |
|---|---|
| Outros autores: | |
| Formato: | Artigo |
| Idioma: | English |
| Publicado: |
Springer US
2021
|
| Acceso en liña: | https://hdl.handle.net/1721.1/131865 |