Fetching the paper…
Reading the bibliography…
The alternating direction method of multipliers (ADMM) has emerged as a powerful technique for large-scale structured optimization.
L. Lasdon, Optimization theory for large systems . Courier Dover Publications, 1970
1970
Earlier work this paper cites.
R. A. Horn and C. R. Johnson, Matrix Analysis . Cambridge, 1985
1985
Earlier work this paper cites.
B. Polyak, Introduction to Optimization . ISBN 0-911575-14-6, 1987
1987
Earlier work this paper cites.
D. P. Bertsekas and J. N. Tsitsiklis, Parallel and distributed computation: numerical methods . Upper Saddle River, NJ, USA: Prentice-Hall, 1989
1989
Earlier work this paper cites.
——, “Parallel alternating direction multiplier decomposition of convex programs,” J. Optim. Theory Appl. , vol. 80, no. 1, pp. 39–62, Jan. 1994
1994
Earlier work this paper cites.
D. Falcao, F. Wu, and L. Murphy, “Parallel and distributed state estimation,” Power Systems, IEEE Transactions on , vol. 10, no. 2, pp. 724–730, May 1995
1995
Earlier work this paper cites.
K. Johansson, “The quadruple-tank process: a multivariable laboratory process with an adjustable zero,” IEEE Transactions on Control Systems Technology , vol. 8, no. 3, pp. 456–465, 2000
2000
Earlier work this paper cites.
Y. Nesterov, Introductory Lectures on Convex Optimization: A Basic Course . Springer-Verlag New York, LCC, 2004
2004
Earlier work this paper cites.
S. Boyd and L. Vandenberghe, Convex Optimization . New York, NY, USA: Cambridge University Press, 2004
2004
Earlier work this paper cites.
L. Xiao and S. Boyd, “Fast linear iterations for distributed averaging,” Systems and Control Letters , vol. 53(1), pp. 65–78, 2004
2004
Earlier work this paper cites.
J. Nocedal and S. J. Wright, Numerical Optimization . Springer New York, 2006
2006
Cited alongside, same era.
M. Figueiredo and J. Bioucas-Dias, “Restoration of poissonian images using alternating direction optimization,” IEEE Transactions on Image Processing , vol. 19, no. 12, pp. 3133–3145, 2010
2010
Cited alongside, same era.
P. A. Forero, A. Cano, and G. B. Giannakis, “Consensus-based distributed support vector machines,” J. Mach. Learn. Res. , vol. 99, pp. 1663–1707, 2010
2010
Cited alongside, same era.
A. Nedic, A. Ozdaglar, and P. Parrilo, “Constrained consensus and optimization in multi-agent networks,” Automatic Control, IEEE Transactions on , vol. 55, no. 4, pp. 922–938, 2010
2010
Cited alongside, same era.
H. Ohlsson, L. Ljung, and S. Boyd, “Segmentation of ARX-models using sum-of-norms regularization,” Automatica , vol. 46, no. 6, pp. 1107–1111, 2010
J. Eckstein, “Augmented lagrangian and alternating direction methods for convex optimization: A tutorial and some illustrative computational results,” RUTCOR Research Report RRR 32-2012, Tech. Rep., December 2012
2012
Later among the works it cites.
T. Goldstein, B. O’Donoghue, S. Setzer, and R. Baraniuk, “Fast alternating direction optimization methods,” UCLA, Tech. Rep., 2012
2012
Later among the works it cites.
S. Joshi, M. Codreanu, and M. Latva-aho, “Distributed SINR balancing for MISO downlink systems via the alternating direction method of multipliers,” in Proceedings of 11th International Symposium on Modeling & Optimization in Mobile, Ad Hoc & Wireless Networks (WiOpt), Tsukuba Science City, Japan , May 2013, pp. 318 – 325
2013
Closest in time.
M. Hong and Z.-Q. Luo, “On the linear convergence of the alternating direction method of multipliers,” ArXiv e-prints , 2013
2013
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2010
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 Issue: 1, pp. 1–122, 2011
2011
Cited alongside, same era.
J. Yang and Y. Zhang, “Alternating direction algorithms for l 1 l_{1} -problems in compressive sensing,” SIAM J. Sci. Comput. , vol. 33, no. 1, pp. 250–278, 2011
2011
Cited alongside, same era.
T. Erseghe, D. Zennaro, E. Dall’Anese, and L. Vangelista, “Fast consensus by the alternating direction multipliers method,” IEEE Transactions on Signal Processing , vol. 59, pp. 5523–5537, 2011
2011
Cited alongside, same era.
B. Wahlberg, S. Boyd, M. Annergren, and Y. Wang, “An ADMM algorithm for a class of total variation regularized estimation problems,” in Proceedings of the16th IFAC Symposium on System Identification, Brussels, Belgium , July 2012, pp. 83–88
2012
Cited alongside, same era.
W. Deng and W. Yin, “On the global and linear convergence of the generalized alternating direction method of multipliers,” Rice University CAAM Technical Report ,TR12-14, 2012., Tech. Rep., 2012
2012
Cited alongside, same era.
[Online]. Available: https://www.dropbox.com/s/x2w74mpbezejbee/MPC_QP_quadtank_170_Np5_SxQ.mat
Cited in the paper.
D. Boley, “Local linear convergence of the alternating direction method of multipliers on quadratic or linear programs,” SIAM Journal on Optimization , vol. 23, no. 4, pp. 2183–2207, 2013
2013
Closest in time.
G. S. B. O’Donoghue and S. Boyd, “A splitting method for optimal control,” IEEE Transactions on Control Systems Technology , vol. 21(6), pp. 2432–2442, 2013
2013
Closest in time.
A. Teixeira, E. Ghadimi, I. Shames, H. Sandberg, and M. Johansson, “Optimal scaling of the admm algorithm for distributed quadratic programming,” in Proceedings of the 52nd IEEE Conference on Decision and Control (CDC), Florence, Italy , December 2013
2013
Closest in time.
W. Shi, Q. Ling, K. Yuan, G. Wu, and W. Yin, “Linearly convergent decentralized consensus optimization with the alternating direction method of multipliers,” in Proceedings of International Conference on Acoustics, Speech, and Signal Processing (ICASSP), Vancouver, Canada , May 2013, pp. 4613 – 4617
2013
Closest in time.
P. Giselsson, “Improving Fast Dual Ascent for MPC - Part II: The Embedded Case,” ArXiv e-prints , Dec. 2013
2013
Closest in time.
E. Ghadimi, I. Shames, and M. Johansson, “Multi-step gradient methods for networked optimization,” Signal Processing, IEEE Transactions on , vol. 61, no. 21, pp. 5417–5429, Nov 2013
2013
Closest in time.