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: | Thao, Nguyen Hieu |
---|---|
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 |
Ejemplares similares
-
Convergence Rates of Forward–Douglas–Rachford Splitting Method
por: Molinari, Cesare, et al.
Publicado: (2019) -
On the asymptotic behavior of the Douglas–Rachford and proximal-point algorithms for convex optimization
por: Banjac, Goran, et al.
Publicado: (2021) -
Hybrid Newton–Successive Substitution Method for Multiphase Rachford-Rice Equations
por: Gao, Ran, et al.
Publicado: (2018) -
Douglas S. Stevenson
Publicado: (1950) -
Douglas Speirs
Publicado: (1906)