Optimally linearizing the alternating direction method of multipliers for convex programming

From MaRDI portal
Publication:2301139

DOI10.1007/s10589-019-00152-3zbMath1432.90111OpenAlexW2986987282WikidataQ126790181 ScholiaQ126790181MaRDI QIDQ2301139

Feng Ma, Bing-sheng He, Xiao-Ming Yuan

Publication date: 28 February 2020

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-019-00152-3




Related Items (20)

Linearized symmetric multi-block ADMM with indefinite proximal regularization and optimal proximal parameterA proximal ADMM with the Broyden family for convex optimization problemsWhiteness-based parameter selection for Poisson data in variational image processingMulti-step inertial strictly contractive PRSM algorithms for convex programming problems with applicationsMajorized iPADMM for Nonseparable Convex Minimization Models with Quadratic Coupling TermsA golden ratio proximal alternating direction method of multipliers for separable convex optimizationInertial-relaxed splitting for composite monotone inclusionsAccelerated stochastic Peaceman-Rachford method for empirical risk minimizationUnderstanding the convergence of the preconditioned PDHG method: a view of indefinite proximal ADMMA relaxed proximal ADMM method for block separable convex programmingConvergence study on the proximal alternating direction method with larger step sizeAn alternating direction method of multipliers with the BFGS update for structured convex quadratic optimizationConvergence rates for an inexact ADMM applied to separable convex optimizationA parallel splitting ALM-based algorithm for separable convex programmingOn the optimal proximal parameter of an ADMM-like splitting method for separable convex programmingADMM-type methods for generalized multi-facility Weber problemConvergence study of indefinite proximal ADMM with a relaxation factorAn inexact symmetric ADMM algorithm with indefinite proximal term for sparse signal recovery and image restoration problemsOn the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite ProgrammingAn inexact ADMM with proximal-indefinite term and larger stepsize


Uses Software


Cites Work


This page was built for publication: Optimally linearizing the alternating direction method of multipliers for convex programming