Cargando…
Modified hybrid decomposition of the augmented Lagrangian method with larger step size for three-block separable convex programming
The Jacobian decomposition and the Gauss–Seidel decomposition of augmented Lagrangian method (ALM) are two popular methods for separable convex programming. However, their convergence is not guaranteed for three-block separable convex programming. In this paper, we present a modified hybrid decompos...
Autores principales: | Sun, Min, Wang, Yiju |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer International Publishing
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6182414/ https://www.ncbi.nlm.nih.gov/pubmed/30363783 http://dx.doi.org/10.1186/s13660-018-1863-z |
Ejemplares similares
-
Fast Augmented Lagrangian Method in the convex regime with convergence guarantees for the iterates
por: Boţ, Radu Ioan, et al.
Publicado: (2022) -
The Convex Information Bottleneck Lagrangian
por: Rodríguez Gálvez, Borja, et al.
Publicado: (2020) -
The Proximal Alternating Minimization Algorithm for Two-Block Separable Convex Optimization Problems with Linear Constraints
por: Bitterlich, Sandy, et al.
Publicado: (2018) -
Mathematical programming via augmented Lagrangians: an introduction with computer programs
por: Pierre, Donald A, et al.
Publicado: (1975) -
A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming
por: Liu, Jing, et al.
Publicado: (2017)