Cargando…
Inducing strong convergence into the asymptotic behaviour of proximal splitting algorithms in Hilbert spaces
Proximal splitting algorithms for monotone inclusions (and convex optimization problems) in Hilbert spaces share the common feature to guarantee for the generated sequences in general weak convergence to a solution. In order to achieve strong convergence, one usually needs to impose more restrictive...
Autores principales: | Boţ, Radu Ioan, Csetnek, Ernö Robert, Meier, Dennis |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Taylor & Francis
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6474735/ https://www.ncbi.nlm.nih.gov/pubmed/31057305 http://dx.doi.org/10.1080/10556788.2018.1457151 |
Ejemplares similares
-
Proximal-gradient algorithms for fractional programming
por: Boţ, Radu Ioan, et al.
Publicado: (2017) -
The Proximal Alternating Minimization Algorithm for Two-Block Separable Convex Optimization Problems with Linear Constraints
por: Bitterlich, Sandy, et al.
Publicado: (2018) -
Fast Augmented Lagrangian Method in the convex regime with convergence guarantees for the iterates
por: Boţ, Radu Ioan, et al.
Publicado: (2022) -
An Inertial Proximal-Gradient Penalization Scheme for Constrained Convex Optimization Problems
por: Boţ, Radu Ioan, et al.
Publicado: (2017) -
Fixing and extending some recent results on the ADMM algorithm
por: Banert, Sebastian, et al.
Publicado: (2020)