Fetching the paper…
Reading the bibliography…
The alternating direction method of multipliers (ADMM) is widely used to solve large-scale linearly constrained optimization problems, convex or nonconvex, in many engineering fields.
Sur l’approximation, par elements finis d’ordre un,et la resolution, par penalisation-dualite, d’une classe de problemes de dirichlet non lineares
R. Glowinski and A. Marroco · 1975
Earlier work this paper cites.
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
D. Gabay and B. Mercier · 1976
Earlier work this paper cites.
Constrained Optimization and Lagrange Multiplier Method
D. P. Bertsekas · 1982
Earlier work this paper cites.
Numerical methods for nonlinear variational problems
R. Glowinski · 1984
Earlier work this paper cites.
Splitting methods for monotone operators with applications to parallel optimization
J. Eckstein · 1989
Earlier work this paper cites.
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
J. Eckstein and D. P. Bertsekas · 1992
Earlier work this paper cites.
D. P. Bertsekas and J. N. Tsitsiklis · 1996
Earlier work this paper cites.
Parallel and Distributed Computation: Numerical Methods, 2nd ed
D. P. Bertsekas and J. N. Tsitsiklis · 1997
Earlier work this paper cites.
Nonlinear Programming, 2nd ed
D. P. Bertsekas · 1999
Earlier work this paper cites.
Convex Optimization
S. Boyd and L. Vandenberghe · 2004
Earlier work this paper cites.
Bregman iterative algorithms for l1-minimization with applications to compressed sensing
W. Yin, S. Osher, D. Goldfarb, and J. Darbon · 2008
Earlier work this paper cites.
Consensus in ad hoc wsns with noisy links - part i: Distributed estimation of deterministic signals
I. Schizas, A. Ribeiro, and G. Giannakis · 2008
Earlier work this paper cites.
An efficient TVL1 algorithm for deblurring multichannel images corrupted by impulsive noise
J. Yang, Y. Zhang, and W. Yin · 2009
Earlier work this paper cites.
Cooperative distributed multi-agent optimization
A. Nedic and A. Ozdaglar · 2009
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.
An alternating direction algorithm for nonnegative matrix factorization
Y. Zhang · 2010
Earlier work this paper cites.
Convergence of a class of stationary iterative methods for saddle point problems
Y. Zhang · 2010
Earlier work this paper cites.
Distributed optimization and statistical learning via the alternating direction method of multipliers
S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein · 2011
Earlier work this paper cites.
A unified primal-dual algorithm framework based on Bregman iteration
X. Zhang, M. Burger, and S. Osher · 2011
Earlier work this paper cites.
Distributed clustering using wireless sensor networks
P.A. Forero, A. Cano, and G.B. Giannakis · 2011
Cited alongside, same era.
An alternating direction algorithm for matrix completion with nonnegative factors
Y. Xu, W. Yin, Z. Wen, and Y. Zhang · 2011
Cited alongside, same era.
On the O(1/n) convergence rate of the Douglas-Rachford alternating direction method
B. He and X. Yuan · 2012
Cited alongside, same era.
Fast alternating linearization methods for minimizing the sum of two convex functions
D. Goldfarb, S. Ma, and K. Scheinberg · 2012
Cited alongside, same era.
On the global linear convergence of alternating direction methods
W. Deng and W. Yin · 2012
Cited alongside, same era.
On the linear convergence of the alternating direction method of multipliers
Min flow rate maximization for software defined radio access networks
W.-C. Liao, M. Hong, Hamid Farmanbar, Xu Li, Z.-Q. Luo, and Hang Zhang · 2014
Closest in time.
Convergence rate analysis of several splitting schemes
D. Davis and W. Yin · 2014
Closest in time.
Fast alternating direction optimization methods
T. Goldstein, B. O’Donoghue, S. Setzer, and R. Baraniuk · 2014
Closest in time.
Parallel multi-block ADMM with o(1/k) convergence
W. Deng, M. Lai, Z. Peng, and W. Yin · 2014
Closest in time.
On the global linear convergence of the admm with multi-block variables
T. Lin, S. Ma, and S. Zhang · 2014
Closest in time.
A block coordinate descent method of multipliers: Convergence analysis and applications
M. Hong, T.-H. Chang, X. Wang, M. Razaviyayn, S. Ma, and Z.-Q. Luo · 2014
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Hong and Z.-Q. Luo · 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.
A note on the alternating direction method of multipliers
D. Han and X. Yuan · 2012
Cited alongside, same era.
Alternating direction methods for classical and ptychographic phase retrieval
Z. Wen, C. Yang, X. Liu, and S. Marchesini · 2012
Cited alongside, same era.
Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers
R. Monteiro and B. Svaiter · 2013
Cited alongside, same era.
The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
C. Chen, B. He, X. Yuan, and Y. Ye · 2013
Cited alongside, same era.
M. Hong, T.-H. Chang, X. Wang, M. Razaviyayn, S. Ma, and Z.-Q. Luo · 2013
Cited alongside, same era.
Alternating direction method of multipliers for non-negative matrix factorization with the beta-divergence
D. L. Sun and C. Fevotte · 2014
Closest in time.
Asynchronous distributed admm for consensus optimization
R. Zhang and J. T. Kwok · 2014
Closest in time.
Alternating directions method of multipliers for l1-penalized zero variance discriminant analysis and principal component analysis
B. Ames and M. Hong · 2014
Closest in time.
A. P. Liavas and N. D. Sidiropoulos · 2014
Closest in time.
Augmented lagrangian alternating direction method for matrix separation based on low-rank factorization
Y. Shen, Z. Wen, and Y. Zhang · 2014
Closest in time.
Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
S. Ghadimi, G. Lan, and H. Zhang · 2014
Closest in time.
Decomposition by partial linearization: Parallel optimization of multi-agent systems
G. Scutari, F. Facchinei, P. Song, D. P. Palomar, and J.-S. Pang · 2014
Closest in time.
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
J. Bolte, S. Sabach, and M. Teboulle · 2014
Closest in time.
A proximal dual consensus admm method for multi-agent constrained optimization
T.-H. Chang · 2014
Closest in time.
On the convergence of alternating direction method of mulitpliers for a family of nonconvex problems
M. Hong, Z.-Q. Luo, and M. Razaviyayn · 2015
Closest in time.
Solving multiple-block separable convex minimization problems using two-block alternating direction method of multipliers
X. Wang, M. Hong, S. Ma, and Z.-Q. Luo · 2015
Closest in time.
First-order algorithms for convex optimization with nonseparate objective and coupled constraints
X. Gao and S. Zhang · 2015
Closest in time.
Accelerated gradient methods for nonconvex nonlinear and stochastic programming
S. Ghadimi and G. Lan · 2015
Closest in time.