Fetching the paper…
Reading the bibliography…
We consider the problem of minimizing block-separable convex functions subject to linear constraints.
The multiplier method of hestenes and powell applied to convex programming
R. Rockafellar · 1973
Earlier work this paper cites.
A dual algorithm for the solution of nonlinear variational problems via finite-element approximations
D. Gabay and B. Mercier · 1976
Earlier work this paper cites.
Augmented lagrangians and applications of the proximal point algorithm in convex programming
R. Rockafellar · 1976
Earlier work this paper cites.
Applications of the method of multipliers to variational inequalities
D. Gabay · 1983
Earlier work this paper cites.
Minimization Methods for Non-Differentiable Functions
N. Z. Shor · 1985
Earlier work this paper cites.
Convex Optimization
S. Boyd and L. Vandenberghe · 2004
Earlier work this paper cites.
The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices
Z. Lin, M. Chen, L. Wu, and Y. Ma · 2009
Earlier work this paper cites.
Alternating direction algorithms for L1-problems in compressive sensing
J. Yang and Y. Zhang · 2009
Earlier work this paper cites.
The composite absolute penalties family for grouped and hierarchical variable selection
P. Zhao, G. Rocha, and B. Yu · 2009
Earlier work this paper cites.
Fast image recovery using variable splitting and constrained optimization
M.V. Afonso, J.M. Bioucas-Dias, and M.A.T. Figueiredo · 2010
Earlier work this paper cites.
Restoration of poissonian images using alternating direction optimization
M. A. T. Figueiredo and J. M. Bioucas-Dias · 2010
Earlier work this paper cites.
Geometric applications of the split Bregman method: segmentation and surface reconstruction
T. Goldstein, X. Bresson, and S. Osher · 2010
Earlier work this paper cites.
Sparse inverse covariance selection via alternating linearization methods
K. Scheinberg, S. Ma, and D. Goldfarb · 2010
Earlier work this paper cites.
Fast l1-minimization algorithms for robust face recognition
A. Yang, A. Ganesh, Z. Zhou, S. Sastry, and Y. Ma · 2010
Earlier work this paper cites.
Stable principal component pursuit
Z. Zhou, X. Li, J. Wright, E. Candes, and Y. Ma · 2010
Earlier work this paper cites.
Convex Optimization with Sparsity-Inducing Norms
F. Bach, R. Jenatton, J. Mairal, and G. Obozinski · 2011
Cited alongside, same era.
Distributed optimization and statistical learning via the alternating direction method of multipliers
S. Boyd, E. Chu N. Parikh, B. Peleato, and J. Eckstein · 2011
Cited alongside, same era.
Robust principal component analysis ? ?
E. J. Candes, X. Li, Y. Ma, and J. Wright · 2011
Cited alongside, same era.
Latent variable graphical model selection via convex optimization
V. Chandrasekaran, P. A. Parrilo, and A. S. Willsky · 2012
Cited alongside, same era.
Smoothing proximal gradient method for general structured sparse regression
X. Chen, Q. Lin, S. Kim, J. G. Carbonell, and E. P. Xing · 2012
Cited alongside, same era.
On the global and linear convergence of the generalized alternating direction method of multipliers
Better approximation and faster algorithm using the proximal average
Y. Yu · 2012
Later among the works it cites.
The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
C. Chen, B. He, Y. Ye, and X. Yuan · 2013
Later among the works it cites.
Bethe-ADMM for tree decomposition based parallel MAP inference
Q. Fu, H. Wang, and A. Banerjee · 2013
Later among the works it cites.
A block successive upper bound minimization method of multipliers for linearly constrained convex optimization
M. Hong, T. Chang, X. Wang, M. Razaviyayn, S. Ma, and Z. Luo · 2013
Later among the works it cites.
Alternating direction methods for latent variable Gaussian graphical model selection
S. Ma, L. Xue, and H. Zou · 2013
Later among the works it cites.
Dual averaging and proximal gradient descent for online alternating direction multiplier method
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
W. Deng and W. Yin · 2012
Cited alongside, same era.
Fast alternating direction optimization methods
T. Goldstein, B. Donoghue, and S. Setzer · 2012
Cited alongside, same era.
Alternating direction method with Gaussian back substitution for separable convex programming
B. He, M. Tao, and X. Yuan · 2012
Cited alongside, same era.
On the O ( 1 / n ) {O}(1/n) convergence rate of the Douglas-Rachford alternating direction method
B. He and X. Yuan · 2012
Cited alongside, same era.
On the linear convergence of the alternating direction method of multipliers
M. Hong and Z. Luo · 2012
Cited alongside, same era.
Online l1-dictionary learning with application to novel document detection
S. Kasiviswanathan, H. Wang, A. Banerjee, and P. Melville · 2012
Cited alongside, same era.
Efficiency of coordinate descent methods on huge-scale optimization methods
Y. Nesterov · 2012
Cited alongside, same era.
T. Suzuki · 2013
Later among the works it cites.
Separable approximations and decomposition methods for the augmented lagrangian
R. Tappenden, P. Richtarik, and B. Buke · 2013
Later among the works it cites.
Bregman alternating direction method of multipliers
H. Wang and A. Banerjee · 2013
Later among the works it cites.
Large scale distributed sparse precesion estimation
H. Wang, A. Banerjee, C. Hsieh, P. Ravikumar, and I. Dhillon · 2013
Later among the works it cites.
Solving multiple-block separable convex minimization problems using two-block alternating direction method of multipliers
X. Wang, M. Hong, S. Ma, and Z. Luo · 2013
Later among the works it cites.
Parallel multi-block admm with o ( 1 / k ) o(1/k) convergence
W. Deng, M. Lai, Z. Peng, and W. Yin · 2014
Closest in time.
Stochastic alternating direction method of multipliers
H. Ouyang, N. He, L. Tran, and A. Gray · 2014
Closest in time.
Proximal algorithms
N. Parikh and S. Boyd · 2014
Closest in time.
Stochastic dual coordinate ascent with alternating direction method of multipliers
T. Suzuki · 2014
Closest in time.