Douglas-Rachford Splitting: Complexity Estimates and Accelerated Variants

R. T. Rockafellar, “Monotone operators and the proximal point algorithm,” SIAM Journal on Control and Optimization , vol. 14, no. 5, pp. 877–898, 1976

1976

Earlier work this paper cites.

P.-L. Lions and B. Mercier, “Splitting algorithms for the sum of two nonlinear operators,” SIAM Journal on Numerical Analysis , vol. 16, no. 6, pp. 964–979, 1979

1979

Earlier work this paper cites.

D. Gabay, “Applications of the method of multipliers to variational inequalities,” in Augmented Lagrangian Methods: Applications to the Solution of Boundary-Value Problems , M. Fortin and R. Glowinski, Eds. North-Holland: Amsterdam, 1983

1983

Earlier work this paper cites.

Y. Nesterov, “A method of solving a convex programming problem with convergence rate O ⁡ ( 1 / k 2 ) {O}(1/k^{2}) ,” Soviet Mathematics Doklady , vol. 27, no. 2, pp. 372–376, 1983

1983

Earlier work this paper cites.

J. Eckstein, “Splitting methods for monotone operators with applications to parallel optimization,” PhD Thesis, Massachusetts Institute of Technology, 1989

1989

Earlier work this paper cites.

J. Eckstein and D. P. Bertsekas, “On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators,” Mathematical Programming , vol. 55, no. 1-3, pp. 293–318, Apr. 1992

1992

Earlier work this paper cites.

C. Lemaréchal and C. Sagastizábal, “Practical aspects of the Moreau–Yosida regularization: Theoretical preliminaries,” SIAM Journal on Optimization , vol. 7, no. 2, pp. 367–385, 1997

1997

Earlier work this paper cites.

——, Introductory lectures on convex optimization: A basic course . Springer, 2003, vol. 87

2003

Earlier work this paper cites.

D. P. Bertsekas, Convex Optimization Theory . Athena Scientific, 2009

2009

Cited alongside, same era.

H. H. Bauschke and P. L. Combettes, Convex analysis and monotone operator theory in Hilbert spaces . Springer, 2011

2011

Cited alongside, same era.

P. L. Combettes and J.-C. Pesquet, “Proximal splitting methods in signal processing,” Fixed-Point Algorithms for Inverse Problems in Science and Engineering , pp. 185–212, 2011

2011

Cited alongside, same era.

S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, “Distributed optimization and statistical learning via the alternating direction method of multipliers,” Foundations and Trends in Machine Learning , vol. 3, no. 1, pp. 1–122, 2011

2011

Cited alongside, same era.

B. He and X. Yuan, “On the O ⁡ ( 1 / n ) O(1/n) convergence rate of the Douglas–Rachford alternating direction method,” SIAM Journal on Numerical Analysis , vol. 50, no. 2, pp. 700–709, Jan. 2012

N. Parikh and S. Boyd, “Proximal algorithms,” Foundations and Trends in Optimization , vol. 1, no. 3, pp. 123–231, 2013

2013

Later among the works it cites.

E. Ghadimi, A. Teixeira, I. Shames, and M. Johansson, “Optimal parameter selection for the alternating direction method of multipliers (ADMM): quadratic problems,” arXiv:1306.2454 [math.OC] , 2013

Original

2013

Later among the works it cites.

P. Patrinos and A. Bemporad, “Proximal Newton methods for convex composite optimization,” in IEEE Conference on Decision and Control , 2013, pp. 2358–2363

2013

Later among the works it cites.

C. C. Gonzaga, E. W. Karas, and D. R. Rossetto, “An optimal algorithm for constrained differentiable convex optimization,” SIAM Journal on Optimization , vol. 23, no. 4, pp. 1939–1955, 2013

2013

Later among the works it cites.

D. Lorenz, “Constructing test instances for basis pursuit denoising,” IEEE Transactions on Signal Processing , vol. 61, no. 5, pp. 1210–1214, 2013