Fetching the paper…
Reading the bibliography…
In this paper, we establish the convergence of the proximal alternating direction method of multipliers (ADMM) and block coordinate descent (BCD) for nonseparable minimization models with quadratic coupling terms.
Sur l’approximation, par elements finis d’ordre un,et la resolution, par penalisation-dualite, d’une classe de problemes de dirichlet non lineares
Glowinski R, Marroco A (1975) · 1975
Earlier work this paper cites.
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
Gabay D, Mercier B (1976) · 1976
Earlier work this paper cites.
Numerical methods for nonlinear variational problems
Glowinski R (1984) · 1984
Earlier work this paper cites.
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
Eckstein J, Bertsekas DP (1992) · 1992
Earlier work this paper cites.
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions
Agarwal A, Negahban S, Wainwright MJ (1997) · 1997
Earlier work this paper cites.
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
Bertsekas DP, Tsitsiklis JN (1997) · 1997
Earlier work this paper cites.
Nonlinear Programming
Bertsekas DP (1999) · 1999
Earlier work this paper cites.
Convergence of a block coordinate descent method for nondifferentiable minimization
Tseng P (2001) · 2001
Earlier work this paper cites.
A coordinate gradient descent method for nonsmooth separable minimization
Tseng P, Yun S (2009) · 2009
Earlier work this paper cites.
Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka-Łojasiewicz inequality
Attouch H, Bolte J, Redont P, Soubeyran A (2010) · 2010
Earlier work this paper cites.
Convergence of a class of stationary iterative methods for saddle point problems
Zhang Y (2010) · 2010
Earlier work this paper cites.
Distributed optimization and statistical learning via the alternating direction method of multipliers
Boyd S, Parikh N, Chu E, Peleato B, Eckstein J (2011) · 2011
Earlier work this paper cites.
A note on the alternating direction method of multipliers
Han D, Yuan X (2012) · 2012
Earlier work this paper cites.
Alternating direction method with Gaussian back substitution for separable convex programming
He B, Tao M, Yuan X (2012) · 2012
Earlier work this paper cites.
On the O ( 1 / n ) (1/n) convergence rate of the Douglas-Rachford alternating direction method
He B, Yuan X (2012) · 2012
Earlier work this paper cites.
On the linear convergence of the alternating direction method of multipliers
Hong M, Luo Z (2012) · 2012
Earlier work this paper cites.
Robust alignment by sparse and low-rank decomposition for linearly correlated images
Peng YG, Ganesh A, Wright J, Xu WL, Ma Y (2012) · 2012
Earlier work this paper cites.
On the convergence analysis of the alternating direction method of multipliers with three blocks
Chen C, Shen Y, You Y (2013) · 2013
Earlier work this paper cites.
An ADM-based splitting method for separable convex programming
Han D, Yuan X, Zhang W, Cai X (2013) · 2013
Cited alongside, same era.
Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers
Monteiro R, Svaiter B (2013) · 2013
Cited alongside, same era.
A unified convergence analysis of block successive minimization methods for nonsmooth optimization
Razaviyayn M, Hong M, Luo Z (2013) · 2013
Cited alongside, same era.
Stochastic dual coordinate ascent methods for regularized loss
Shalev-Shwartz S, Zhang T (2013) · 2013
Cited alongside, same era.
Proximal alternating linearized minimization nonconvex and nonsmooth problems
Bolte J, Sabach SY, Teboulle M (2014) · 2014
Cited alongside, same era.
Convergence rate analysis of several splitting schemes
Davis D, Yin W (2014) · 2014
On the sublinear convergence rate of multi-block ADMM
Lin T, Ma S, Zhang S (2015) · 2015
Closest in time.
On the complexity analysis of randomized block-coordinate descent methods
Lu Z, Xiao L (2015) · 2015
Closest in time.
Distributed optimization with local domains: Applications in MPC and network flows
Mota JFC, Xavier JMF, Aguiar PMF, Puschel M (2015) · 2015
Closest in time.
A convergent 3-block semi-proximal alternating direction method of multipliers for conic programming with 4-block constraints
Sun D, Toh K-C, Yang L (2015) · 2015
Closest in time.
On the expected convergence of randomly permuted ADMM
Sun R, Luo Z, Ye Y (2015) · 2015
Closest in time.
Coordinate descent algorithms
Wright S (2015) · 2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
An alternating direction method approach to traffic management
Feng C, Xu H, Li BC (2014) · 2014
Cited alongside, same era.
Hong M, Chang T, Wang X, Razaviyayn M, Ma S, Luo Z (2014) · 2014
Cited alongside, same era.
Hong M, Luo Z, Razaviyayn M (2014) · 2014
Cited alongside, same era.
Iterations complexity analysis for block coordinate descent method
Hong M, Wang X, Razaviyayn M, Luo Z (2014) · 2014
Cited alongside, same era.
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
Richtárik P, Takác̆ M (2014) · 2014
Cited alongside, same era.
On the convergence of alternating minimization for convex programming with applications to iteratively reweighted least squares and decomposition schemes
Beck A (2015) · 2015
Cited alongside, same era.
Closest in time.
The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
Chen C, He B, Ye Y, Yuan X (2016) · 2016
Closest in time.
On the convergence properties of a majorized alternating direction method of multipliers for linearly constrained convex optimization problems with coupled objective functions
Cui Y, Li X, Sun D, Toh K-C (2016) · 2016
Closest in time.
Parallel multi-block ADMM with o ( 1 / k ) o(1/k) convergence
Deng W, Lai M., Peng Z., Yin W(2016) · 2016
Closest in time.
On the global and linear convergence of the generalized alternating direction method of multipliers
Deng W, Yin W (2016) · 2016
Closest in time.
A majorized ADMM with indefinite proximal terms for linearly constrained convex composite optimization
Li M, Sun D, Toh K-C (2016) · 2016
Closest in time.
A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
Li X, Sun D, Toh K-C (2016) · 2016
Closest in time.
On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
Shefi R, Teboulle M (2016) · 2016
Closest in time.
On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function
Cai X, Han D, Yuan X (2017) · 2017
Closest in time.
A note on the convergence of ADMM for linearly constrained convex optimization problems
Chen L, Sun D, Toh K-C (2017) · 2017
Closest in time.
An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
Chen L, Sun D, Toh K-C (2017) · 2017
Closest in time.
On the convergence of block coordinate descent type methods
Beck A, Tetruashvili L (2013) · 2060
Closest in time.