Cargando…
A convergent relaxation of the Douglas–Rachford algorithm
This paper proposes an algorithm for solving structured optimization problems, which covers both the backward–backward and the Douglas–Rachford algorithms as special cases, and analyzes its convergence. The set of fixed points of the corresponding operator is characterized in several cases. Converge...
| Autor principal: | |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer US
2018
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6445491/ https://www.ncbi.nlm.nih.gov/pubmed/31007390 http://dx.doi.org/10.1007/s10589-018-9989-y |