Fetching the paper…
Reading the bibliography…
Consider the problem of minimizing the sum of a smooth convex function and a separable nonsmooth convex function subject to linear coupling constraints.
A Convergence Theorem for Non-Negative Almost Supermartingales and Some Applications
H. Robbins and D. Siegmund, · 1971
Earlier work this paper cites.
Iterative Solution of Nonlinear Equations in Several Variables
J. M. Ortega and W. C. Rheinboldt, · 1972
Earlier work this paper cites.
“Sur l’approximation par èlèments finis et la rèsolution par pènalisation-dualitè d’une classe de problèmes de dirichlet non linèaires,”
R. Glowinski and A. Marrocco, · 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.
“Augmented lagrangian and operator splitting methods in nonlinear mechanics,”
R. Glowinski and P. Le Tallec, · 1989
Earlier work this paper cites.
“On the convergence of the coordinate descent method for convex differentiable minimization,”
Z.-Q. Luo and P. Tseng, · 1992
Earlier work this paper cites.
“On the linear convergence of descent methods for convex essentially smooth minimization,”
Z.-Q. Luo and P. Tseng, · 1992
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.
“Error bounds and convergence analysis of feasible descent methods: a general approach,”
Z.-Q. Luo and P. Tseng, · 1993
Earlier work this paper cites.
“On the convergence rate of dual ascent methods for strictly convex minimization.,”
Z.-Q. Luo and P. Tseng, · 1993
Earlier work this paper cites.
“Some saddle-function splitting methods for convex programming,”
J. Eckstein, · 1994
Earlier work this paper cites.
Neuro-Dynamic Programming
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.
“Atomic decomposition by basis pursuit,”
S. S. Chen, D. L. Donoho, and M. A. Saunders, · 1998
Earlier work this paper cites.
“On the convergence of constrained parallel variable distribution algorithms,”
M. V. Solodov, · 1998
Earlier work this paper cites.
Nonlinear Programming, 2nd ed
D. P. Bertsekas, · 1999
Earlier work this paper cites.
“On the convergence of the block nonlinear Gauss-Seidel method under convex constraints,”
L. Grippo and M. Sciandrone, · 2000
Earlier work this paper cites.
“Convergence of a block coordinate descent method for nondifferentiable minimization,”
P. Tseng, · 2001
Earlier work this paper cites.
“A new inexact alternating directions method for monotone variational inequalities,”
B. He, L. Liao, D. Han, and H. Yang, · 2002
Earlier work this paper cites.
“In the matter of facilitating opportunisties for flexible, efficient and reliable spectrum use emplying Coginitive Raido technologies,” Dec 2003,
FCC, · 2003
Earlier work this paper cites.
Convex Optimization
S. Boyd and L. Vandenberghe, · 2004
Earlier work this paper cites.
“A model for generating household electricity load profiles,”
J. V. Paatero and P. D. Lund, · 2006
Earlier work this paper cites.
“Model selection and estimation in regression with grouped variables,”
M. Yuan and Y. Lin, · 2006
Earlier work this paper cites.
“A survey of dynamic spectrum access,”
Q. Zhao and B. M. Sadler, · 2007
Cited alongside, same era.
“Gradient methods for minimizing composite objective function,”
Y. Nesterov, · 2007
Cited alongside, same era.
“Bregman iterative algorithms for l1-minimization with applications to compressed sensing,”
W. Yin, S. Osher, D. Goldfarb, and J. Darbon, · 2008
Cited alongside, same era.
“Fixed-point continuation for ℓ 1 \ell_{1} -minimization: Methodology and convergence,”
E. Hale, W. Yin, and Y. Zhang, · 2008
Cited alongside, same era.
“A coordinate gradient descent method for nonsmooth separable minimization,”
P. Tseng and S. Yun, · 2009
Cited alongside, same era.
“An efficient tvl1 algorithm for deblurring multichannel images corrupted by impulsive noise,”
“Demand side management in the smart grid: Information processing for the power switch,”
M. Alizadeh, X. Li, Z. Wang, A. Scaglione, and R. Melton, · 2012
Later among the works it cites.
“Coordinated home energy management for real-time power balancing,”
T.-H. Chang, M. Alizadeh, and A. Scaglione, · 2012
Later among the works it cites.
“Efficiency of coordiate descent methods on huge-scale optimization problems,”
Y. Nesterov, · 2012
Later among the works it cites.
“On the linear convergence of approximate proximal splitting methods for non-smooth convex minimization,”
M. Sanjabi, M. Kadkhodaei, and Z.-Q. Luo, · 2012
Later among the works it cites.
“Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function,”
P. Richtarik and M. Takac, · 2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. Yang, Y. Zhang, and W. Yin, · 2009
Cited alongside, same era.
“Cooperative distributed multi-agent optimization,”
A. Nedic and A. Ozdaglar, · 2009
Cited alongside, same era.
“Sparse reconstruction by separable approximation,”
S.J. Wright, R.D. Nowak, and M.A.T. Figueiredo, · 2009
Cited alongside, same era.
“A fast iterative shrinkage-thresholding algorithm for linear inverse problems,”
A. Beck and M. Teboulle, · 2009
Cited alongside, same era.
“MIMO cognitive radio: A game theoretical approach,”
G. Scutari and D.P. Palomar, · 2010
Cited alongside, same era.
“Regularization paths for generalized linear models via coordinate descent,”
Friedman J, Hastie T, and Tibshirani R., · 2010
Cited alongside, same era.
“Approximation accuracy, gradient methods, and error bound for structured convex optimization,”
P. Tseng, · 2010
Cited alongside, same era.
X. Wang and X. Yuan, · 2012
Later among the works it cites.
“On the o(1/n) convergence rate of the douglas-rachford alternating direction method,”
B. He and X. Yuan, · 2012
Later among the works it cites.
“Fast alternating direction optimization methods,”
T. Goldstein, B. O’Donoghue, and S. Setzer, · 2012
Later among the works it cites.
“On the global linear convergence of alternating direction methods,”
W. Deng and W. Yin, · 2012
Later among the works it cites.
“On the linear convergence of the alternating direction method of multipliers,”
M. Hong and Z.-Q. Luo, · 2012
Later among the works it cites.
“Alternating direction method with gaussian back substitution for separable convex programming,”
B. He, M. Tao, and X. Yuan, · 2012
Later among the works it cites.
“Alternating proximal gradient method for convex minimization,”
S. Ma, · 2012
Later among the works it cites.
“Fast alternating linearization methods for minimizing the sum of two convex functions,”
D. Goldfarb, S. Ma, and K. Scheinberg, · 2012
Later among the works it cites.
“On the nonaymptotic convergence of cyclic coordinate descent method,”
A. Saha and A. Tewari, · 2013
Later among the works it cites.
“On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems,”
H. Zhang, J. Jiang, and Z.-Q. Luo, · 2013
Later among the works it cites.
“On the convergence of block coordinate descent type methods,”
A. Beck and L. Tetruashvili, · 2013
Later among the works it cites.
“Iteration complexity analysis for a family of block coordinate descent method for convex nonsmooth optimization,”
M. Hong, X. Wang, M. Razaviyayn, and Z.-Q. Luo, · 2013
Later among the works it cites.
“Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers,”
R. Monteiro and B. Svaiter, · 2013
Later among the works it cites.
“Linear convergence of ADMM on a model problem,”
D. Boley, · 2013
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, X. Yuan, and Y. Ye, · 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.-Q. Luo, · 2013
Later among the works it cites.
“On the linear convergence of the proximal gradient method for trace norm regularization,”
K. Hou, Z. Zhou, A. M.-S. So, and Z.-Q. Luo, · 2014
Closest in time.
“Flexible parallel algorithms for big data optimization,”
F. Facchinei, S. Sagratella, and G. Scutari, · 2014
Closest in time.