ADMM without a Fixed Penalty Parameter: Faster Convergence with New Adaptive Penalization
暂无分享,去创建一个
Mingrui Liu | Tianbao Yang | Yi Xu | Qihang Lin | Mingrui Liu | Tianbao Yang | Yi Xu | Qihang Lin
[1] Leon Wenliang Zhong,et al. Fast Stochastic Alternating Direction Method of Multipliers , 2013, ICML.
[2] Eric P. Xing,et al. A multivariate regression approach to association analysis of a quantitative trait network , 2008, Bioinform..
[3] K. Kurdyka. On gradients of functions definable in o-minimal structures , 1998 .
[4] Xiaoming Yuan,et al. An alternating direction method of multipliers with a worst-case O(1/n2) convergence rate , 2018, Mathematics of Computation.
[5] Zheng Xu,et al. Adaptive ADMM with Spectral Penalty Parameter Selection , 2016, AISTATS.
[6] Elad Hazan,et al. An optimal algorithm for stochastic strongly-convex optimization , 2010, 1006.2425.
[7] B. He,et al. Alternating Direction Method with Self-Adaptive Penalty Parameters for Monotone Variational Inequalities , 2000 .
[8] Mingrui Liu,et al. Adaptive Accelerated Gradient Converging Method under H\"{o}lderian Error Bound Condition , 2016, NIPS.
[9] Guoyin Li,et al. Global error bounds for piecewise convex polynomials , 2013, Math. Program..
[10] Xiaoming Yuan,et al. Faster Alternating Direction Method of Multipliers with a Worst-case O ( 1 / n 2 ) Convergence Rate , 2016 .
[11] Zhixun Su,et al. Linearized Alternating Direction Method with Adaptive Penalty for Low-Rank Representation , 2011, NIPS.
[12] Xavier Bresson,et al. Bregmanized Nonlocal Regularization for Deconvolution and Sparse Reconstruction , 2010, SIAM J. Imaging Sci..
[13] R. Tibshirani,et al. Sparsity and smoothness via the fused lasso , 2005 .
[14] Yong Yu,et al. Robust Subspace Segmentation by Low-Rank Representation , 2010, ICML.
[15] Bingsheng He,et al. On non-ergodic convergence rate of Douglas–Rachford alternating direction method of multipliers , 2014, Numerische Mathematik.
[16] Bingsheng He,et al. On the O(1/n) Convergence Rate of the Douglas-Rachford Alternating Direction Method , 2012, SIAM J. Numer. Anal..
[17] Tianbao Yang,et al. Homotopy Smoothing for Non-Smooth Problems with Lower Complexity than O(1/\epsilon) , 2016, NIPS.
[18] Zhi-Quan Luo,et al. On the linear convergence of the alternating direction method of multipliers , 2012, Mathematical Programming.
[19] Yunmei Chen,et al. An Accelerated Linearized Alternating Direction Method of Multipliers , 2014, SIAM J. Imaging Sci..
[20] R. Tibshirani,et al. Sparse inverse covariance estimation with the graphical lasso. , 2008, Biostatistics.
[21] Stephen P. Boyd,et al. Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..
[22] Bruce W. Suter,et al. From error bounds to the complexity of first-order descent methods for convex functions , 2015, Math. Program..
[23] Taiji Suzuki,et al. Stochastic Dual Coordinate Ascent with Alternating Direction Method of Multipliers , 2014, ICML.
[24] Tong Zhang,et al. Adaptive Stochastic Alternating Direction Method of Multipliers , 2015, ICML.
[25] Alexander G. Gray,et al. Stochastic Alternating Direction Method of Multipliers , 2013, ICML.
[26] Renato D. C. Monteiro,et al. Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers , 2013, SIAM J. Optim..
[27] R. Tibshirani,et al. The solution path of the generalized lasso , 2010, 1005.1971.
[28] James T. Kwok,et al. Fast-and-Light Stochastic ADMM , 2016, IJCAI.
[29] s-taiji. Dual Averaging and Proximal Gradient Descent for Online Alternating Direction Multiplier Method , 2013 .
[30] Saeed Ghadimi,et al. Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization, II: Shrinking Procedures and Optimal Algorithms , 2013, SIAM J. Optim..
[31] Tianbao Yang,et al. Stochastic Convex Optimization: Faster Local Growth Implies Faster Global Convergence , 2017, ICML.
[32] Stanley Osher,et al. A Unified Primal-Dual Algorithm Framework Based on Bregman Iteration , 2010, J. Sci. Comput..
[33] Yurii Nesterov,et al. Linear convergence of first order methods for non-strongly convex optimization , 2015, Math. Program..
[34] Tianbao Yang,et al. RSG: Beating Subgradient Method without Smoothness and Strong Convexity , 2015, J. Mach. Learn. Res..
[35] Richard G. Baraniuk,et al. Fast Alternating Direction Optimization Methods , 2014, SIAM J. Imaging Sci..
[36] R. Tibshirani. Regression Shrinkage and Selection via the Lasso , 1996 .
[37] Wotao Yin,et al. On the Global and Linear Convergence of the Generalized Alternating Direction Method of Multipliers , 2016, J. Sci. Comput..