Cargando…
Fixing and extending some recent results on the ADMM algorithm
We investigate the techniques and ideas used in Shefi and Teboulle (SIAM J Optim 24(1), 269–297, 2014) in the convergence analysis of two proximal ADMM algorithms for solving convex optimization problems involving compositions with linear operators. Besides this, we formulate a variant of the ADMM a...
Autores principales: | Banert, Sebastian, Boţ, Radu Ioan, Csetnek, Ernö Robert |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer US
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7862544/ https://www.ncbi.nlm.nih.gov/pubmed/33603318 http://dx.doi.org/10.1007/s11075-020-00934-5 |
Ejemplares similares
-
Proximal-gradient algorithms for fractional programming
por: Boţ, Radu Ioan, et al.
Publicado: (2017) -
Inducing strong convergence into the asymptotic behaviour of proximal splitting algorithms in Hilbert spaces
por: Boţ, Radu Ioan, et al.
Publicado: (2018) -
Gradient-type penalty method with inertial effects for solving constrained convex optimization problems with smooth data
por: Boţ, Radu Ioan, et al.
Publicado: (2017) -
An accelerated minimax algorithm for convex-concave saddle point problems with nonsmooth coupling function
por: Boţ, Radu Ioan, et al.
Publicado: (2022) -
A general double-proximal gradient algorithm for d.c. programming
por: Banert, Sebastian, et al.
Publicado: (2018)