[1] |
NESTEROV Y.Primal-dual subgradient methods for convex problems[J].Mathematical Programming,2009,120(1):221-259.
|
[2] |
BERTSEKAS D P,NEDI A,OZDAGLAR A E.Convex analysis and optimization[M].Berlin,Germany:Springer,2003.
|
[3] |
BECK A,TEBOULLE M.Mirror descent and nonlinear projected sub-gradient methods for convex optimization[J].Operations Research Letters,2003,31(3):167-175.
|
[4] |
ZHANG Tong.Solving large scale linear prediction problems using stochastic gradient descent algorithms[C]//Proceedings of the 21st International Conference on Machine Learning.New York,USA:ACM Press,2004:919-926.
|
[5] |
SCHMIDT M,ROUX N L,BACH F.Convergence rates of inexact proximal gradient methods for convex optimization[J].Advances in Neural Information Processing Systems,2011,24:1458-1466.
|
[6] |
DEVOLDER O.Stochastic first order methods in smooth convex optimization[EB/OL].[2018-07-20].https://core.ac.uk/download/pdf/34135646.pdf.
|
[7] |
HONORIO J.Convergence rates of biased stochastic optimization for learning sparse ising models[C]//Proceedings of International Conference on Machine Learning.Madison,USA:Omnipress,2012:257-264.
|
[8] |
DASPREMONT A.Smooth optimization with approximate gradient[J].SIAM Journal on Optimization,2008,19(3):1171-1183.
|
[9] |
DEVOLDER O,GLINEUR F,NESTEROV Y.First-order methods of smooth convex optimization with inexact oracle[J].Mathematical Programming,2014,146(1/2):37-75.
|
[10] |
RAKHLIN A,SHAMIR O,SRIDHARAN K.Making gradient descent optimal for strongly convex stochastic optimiza-tion[C]//Proceedings of International Conference on Machine Learning.Madison,USA:Omnipress,2012:1571-1578.
|
[11] |
SHAMIR O,ZHANG Tong.Stochastic gradient descent for non-smooth optimization:convergence results and optimal averaging schemes[C]//Proceedings of International Conference on Machine Learning.Madison,USA:Omnipress,2013:71-79.
|
[12] |
NESTEROV Y,SHIKHMAN V.Quasi-monotone subgradient methods for nonsmooth convex minimization[J].Journal of Optimization Theory and Applications,2015,165(3):917-940.
|
[13] |
陶蔚,潘志松,储德军,等.使用Nesterov步长策略投影次梯度方法的个体收敛性[J].计算机学报,2018,41(1):164-176.
|
[14] |
DUCHI J,SHALEV-SHWARTZ S,SINGER Y,et al.Composite objective mirror descent[EB/OL].[2018-07-20].http://web.stanford.edu/~jduchi/projects/DuchiShSiTe10.pdf.
|
[15] |
NESTEROV Y.A method of solving a convex programming problem with convergence rate O(1/k2)[J].Soviet Mathematics Doklady,1983,27(2):372-376.
|
[16] |
HU Chonghai,KWOK J T,PAN W.Accelerated gradient methods for stochastic optimization and online learning[C]//Proceedings of the 22nd International Conference on Neural Information Processing Systems.[S.l.]:Curran Associates Inc.,2009:781-789.
|
[17] |
TSENG P.Approximation accuracy,gradient methods,and error bound for structured convex optimization[J].Mathematical Programming,2010,125(2):263-295.
|
[18] |
陶蔚,潘志松,朱小辉,等.线性插值投影次梯度方法的最优个体收敛速率[J].计算机研究与发展,2017,54(3):529-536.
|
[19] |
XIAO Lin,ZHANG Tong.A proximal stochastic gradient method with progressive variance reduction[J].SIAM Journal on Optimization,2014,24(4):2057-2075.
|
[20] |
瓦普尼克.统计学习理论的本质[M].张学工,译.北京:清华大学出版社,2000.
|