CLC number: TP311
On-line Access: 2018-08-06
Received: 2016-12-03
Revision Accepted: 2017-04-17
Crosschecked: 2018-06-07
Cited: 0
Clicked: 7519
Qiang Lan, Lin-bo Qiao, Yi-jie Wang. Stochastic extra-gradient based alternating direction methods for graph-guided regularized minimization[J]. Frontiers of Information Technology & Electronic Engineering,in press.https://doi.org/10.1631/FITEE.1601771 @article{title="Stochastic extra-gradient based alternating direction methods for graph-guided regularized minimization", %0 Journal Article TY - JOUR
图引导正则最小化的随机超梯度的交替方向方法关键词组: Darkslateblue:Affiliate; Royal Blue:Author; Turquoise:Article
Reference[1]Azadi S, Sra S, 2014. Towards an optimal stochastic alternating direction method of multipliers. Int Conf on Machine Learning, p.620-628. [2]Boyd S, Parikh N, Chu E, et al., 2011. Distributed optimization and statistical learning via the alternating direction method of multipliers. Found Trends Mach Learn, 3(1):1-122. [3]Cortes C, Vapnik V, 1995. Support-vector networks. Mach Learn, 20(3):273-297. [4]Gao X, Jiang B, Zhang S, 2017. On the information-adaptive variants of the ADMM: an iteration complexity perspective. J Sci Comput, 76(1):327-363. [5]Hastie T, Tibshirani R, Friedman J, 2001. The Elements of Statistical Learning: Data Mining, Inference, and Prediction. Springer-Verlag, New York, USA. [6]Hsieh CJ, Sustik MA, Dhillon IS, et al., 2013. BIG & QUIC: sparse inverse covariance estimation for a million variables. Advances in Neural Information Processing Systems, p.3165-3173. [7]Johnson R, Zhang T, 2013. Accelerating stochastic gradient descent using predictive variance reduction. Advances in Neural Information Processing Systems, p.315-323. [8]Lin T, Ma S, Zhang S, 2015. An extra-gradient-based alternating direction method for convex minimization. Found Comput Math, 17(1):35-59. [9]Lin T, Qiao L, Zhang T, et al., 2018. Stochastic primal-dual proximal extra-gradient descent for compositely regularized optimization. Neurocomputing, 273:516-525. [10]Ouyang H, He N, Tran L, et al., 2013. Stochastic alternating direction method of multipliers. Int Conf on Machine Learning, p.80-88. [11]Qiao LB, Zhang BF, Su JS, et al., 2017. A systematic review of structured sparse learning. Front Inform Technol Electron Eng, 18(4):445-463. [12]Suzuki T, 2013. Dual averaging and proximal gradient descent for online alternating direction multiplier method. Int Conf on Machine Learning, p.392-400. [13]Tibshirani R, Saunders M, Rosset S, et al., 2005. Sparsity and smoothness via the fused lasso. J R Stat Soc Ser B, 67:91-108. [14]Tibshirani R, 1996. Regression shrinkage and selection via the lasso. J R Stat Soc Ser B, 1:267-288. [15]Wang H, Banerjee A, 2013. Online alternating direction method (longer version). arXiv preprint 1306.3721, 1(1):1-8. [26]Yang JF, Yuan XM, 2013. Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization. Math Comput, 82(281):301-329. [17]Zhao P, Yang J, Zhang T, et al., 2015. Adaptive stochastic alternating direction method of multipliers. Int Conf on Machine Learning, p.69-77. [18]Zhong W, Kwok JT, 2013. Fast stochastic alternating direction method of multipliers. Int Conf on Machine Learning, p.46-54. Journal of Zhejiang University-SCIENCE, 38 Zheda Road, Hangzhou
310027, China
Tel: +86-571-87952783; E-mail: cjzhang@zju.edu.cn Copyright © 2000 - 2024 Journal of Zhejiang University-SCIENCE |
Open peer comments: Debate/Discuss/Question/Opinion
<1>