{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T00:00:01Z","timestamp":1740182401237,"version":"3.37.3"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,5,24]],"date-time":"2021-05-24T00:00:00Z","timestamp":1621814400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,24]],"date-time":"2021-05-24T00:00:00Z","timestamp":1621814400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN Oper. Res. Forum"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s43069-021-00059-y","type":"journal-article","created":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T13:02:48Z","timestamp":1637240568000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Randomized Smoothing Variance Reduction Method for Large-Scale Non-smooth Convex Optimization"],"prefix":"10.1007","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1358-213X","authenticated-orcid":false,"given":"Wenjie","family":"Huang","sequence":"first","affiliation":[]},{"given":"Xun","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,24]]},"reference":[{"key":"59_CR1","unstructured":"Johnson R, Zhang T\u00a0(2013)\u00a0Accelerating stochastic gradient descent using predictive variance reduction. In: Adv Neural Inf Proces Syst, pp 315\u2013323"},{"issue":"4","key":"59_CR2","doi-asserted-by":"publisher","first-page":"2057","DOI":"10.1137\/140961791","volume":"24","author":"L Xiao","year":"2014","unstructured":"Xiao L, Zhang T (2014) A proximal stochastic gradient method with progressive variance reduction. SIAM J Optim 24(4):2057\u20132075","journal-title":"SIAM J Optim"},{"key":"59_CR3","doi-asserted-by":"publisher","unstructured":"Shalev-Shwartz S, Zhang T\u00a0(2016) Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization.\u00a0Math Program 155(1\u20132, Ser. A):105\u2013145.\u00a0https:\/\/doi.org\/10.1007\/s10107-014-0839-0","DOI":"10.1007\/s10107-014-0839-0"},{"key":"59_CR4","first-page":"567","volume":"14","author":"S Shalev-Shwartz","year":"2013","unstructured":"Shalev-Shwartz S, Zhang T (2013) Stochastic dual coordinate ascent methods for regularized loss minimization. J Mach Learn Res 14:567\u2013599","journal-title":"J Mach Learn Res"},{"key":"59_CR5","unstructured":"Gong P, Ye J\u00a0(2014) Linear convergence of variance-reduced stochastic gradient without strong convexity. arXiv preprint. arXiv:1406.1102"},{"key":"59_CR6","unstructured":"Allen-Zhu Z, Yuan Y (2016) Improved svrg for non-strongly-convex or sum-of-non-convex objectives. In: International Conference on Machine Learning, pp 1080\u20131089"},{"key":"59_CR7","unstructured":"Mairal J (2017) A generic quasi-newton algorithm for faster gradient-based optimization"},{"key":"59_CR8","unstructured":"Lucchi A, McWilliams B, Hofmann T\u00a0(2015) A variance reduced stochastic newton method. arXiv preprint. arXiv:1503.08316"},{"key":"59_CR9","unstructured":"Moritz P, Nishihara R, Jordan M (2016) A linearly-convergent stochastic l-bfgs algorithm. In: Artificial Intelligence and Statistics, pp 249\u2013258"},{"key":"59_CR10","unstructured":"Vainsencher D, Liu H, Zhang T\u00a0(2015) Local smoothness in variance reduced optimization. In: Adv Neural Inf Proces Syst, pp 2179\u20132187"},{"key":"59_CR11","first-page":"441","volume":"10","author":"S Agarwal","year":"2009","unstructured":"Agarwal S, Niyogi P (2009) Generalization bounds for ranking algorithms via algorithmic stability. J Mach Learn Res 10:441\u2013474","journal-title":"J Mach Learn Res"},{"key":"59_CR12","unstructured":"Xing EP, Jordan MI, Russell SJ, Ng AY\u00a0(2003) Distance metric learning with application to clustering with side-information. In: Adv Neural Inf Proces Syst, pp 521\u2013528"},{"key":"59_CR13","doi-asserted-by":"crossref","unstructured":"Shai-Shwartz S, Singer Y, Ng A\u00a0(2004) Online and batch learning of pseudo-metrics. In: Machine Learning, Proceedings of the Twenty-first International Conference (ICML 2004). ACM Press, New York, NY.","DOI":"10.1145\/1015330.1015376"},{"key":"59_CR14","doi-asserted-by":"publisher","first-page":"21","DOI":"10.21314\/JOR.2000.038","volume":"2","author":"RT Rockafellar","year":"2000","unstructured":"Rockafellar RT, Uryasev S et al (2000) Optimization of conditional value-at-risk. J Risk 2:21\u201342","journal-title":"J Risk"},{"key":"59_CR15","doi-asserted-by":"publisher","first-page":"43","DOI":"10.21314\/JOR.2002.057","volume":"4","author":"P Krokhmal","year":"2002","unstructured":"Krokhmal P, Palmquist J, Uryasev S (2002) Portfolio optimization with conditional value-at-risk objective and constraints. J Risk 4:43\u201368","journal-title":"J Risk"},{"issue":"1\u20134","key":"59_CR16","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0167-2789(92)90242-F","volume":"60","author":"LI Rudin","year":"1992","unstructured":"Rudin LI, Osher S, Fatemi E (1992) Nonlinear total variation based noise removal algorithms. Physica D 60(1\u20134):259\u2013268","journal-title":"Physica D"},{"issue":"1\u20132","key":"59_CR17","first-page":"89","volume":"20","author":"A Chambolle","year":"2004","unstructured":"Chambolle A (2004) An algorithm for total variation minimization and applications. J Math Imaging Vision 20(1\u20132):89\u201397","journal-title":"J Math Imaging Vision"},{"key":"59_CR18","unstructured":"Shamir O, Zhang T (2013) Stochastic gradient descent for non-smooth optimization: Convergence results and optimal averaging schemes. In: International Conference on Machine Learning, pp 71\u201379"},{"key":"59_CR19","doi-asserted-by":"crossref","unstructured":"Shalev-Shwartz S, Shamir O, Srebro N, Sridharan K (2009) Stochastic convex optimization. In: COLT","DOI":"10.1145\/1390156.1390273"},{"key":"59_CR20","unstructured":"Yang T, Lin Q\u00a0(2015) Rsg: Beating subgradient method without smoothness and strong convexity. arXiv preprint. arXiv:1512.03107"},{"key":"59_CR21","unstructured":"Yang T, Lin Q\u00a0(2015) Stochastic subgradient methods with linear convergence for polyhedral convex optimization. arXiv preprint. arXiv:1510.01444"},{"key":"59_CR22","unstructured":"Xu Y, Lin Q, Yang T\u00a0(2017) Stochastic convex optimization: Faster local growth implies faster global convergence. In: International Conference on Machine Learning, pp 3821\u20133830"},{"key":"59_CR23","doi-asserted-by":"crossref","unstructured":"Nedi\u0107 A, Bertsekas D\u00a0(2001) Convergence rate of incremental subgradient algorithms. In: Stochastic optimization: algorithms and applications.\u00a0Springer,\u00a0pp 223\u2013264","DOI":"10.1007\/978-1-4757-6594-6_11"},{"key":"59_CR24","unstructured":"Johnstone PR, Moulin P\u00a0(2017)\u00a0Faster subgradient methods for functions with h\\'' olderian growth. arXiv preprint. arXiv:1704.00196"},{"issue":"1","key":"59_CR25","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s101070050078","volume":"86","author":"SM Robinson","year":"1999","unstructured":"Robinson SM (1999) Linear convergence of epsilon-subgradient descent methods for a class of convex functions. Math Program 86(1):41\u201350","journal-title":"Math Program"},{"key":"59_CR26","doi-asserted-by":"publisher","unstructured":"Zhang H\u00a0(2020) New analysis of linear convergence of gradient-type methods via unifying error bound conditions.\u00a0Math Program 120(1\u20132, Ser. A):371\u2013416.\u00a0https:\/\/doi.org\/10.1007\/s10107-018-01360-1","DOI":"10.1007\/s10107-018-01360-1"},{"issue":"1","key":"59_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/10556780290027828","volume":"17","author":"M M\u00e4kel\u00e4","year":"2002","unstructured":"M\u00e4kel\u00e4 M (2002) Survey of bundle methods for nonsmooth optimization. Optimization methods and software 17(1):1\u201329","journal-title":"Optimization methods and software"},{"key":"59_CR28","unstructured":"Le QV, Smola AJ, Vishwanathan S (2008) Bundle methods for machine learning. In: Adv Neural Inf Proces Syst, pp 1377\u20131384"},{"issue":"2","key":"59_CR29","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1137\/S1052623496303329","volume":"8","author":"R Mifflin","year":"1998","unstructured":"Mifflin R, Sun D, Qi L (1998) Quasi-newton bundle-type methods for nondifferentiable convex optimization. SIAM J Optim 8(2):583\u2013603","journal-title":"SIAM J Optim"},{"key":"59_CR30","doi-asserted-by":"publisher","unstructured":"Shen J, Pang LP, Li D\u00a0(2013) An approximate quasi-{N}ewton bundle-type method for nonsmooth optimization. Abstr Appl Anal 2013:7.\u00a0https:\/\/doi.org\/10.1155\/2013\/697474","DOI":"10.1155\/2013\/697474"},{"key":"59_CR31","unstructured":"Lewis A, Wylie C\u00a0(2019)\u00a0A simple newton method for local nonsmooth optimization. arXiv preprint. arXiv:1907.11742"},{"issue":"1","key":"59_CR32","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov Y (2005) Smooth minimization of non-smooth functions. Math Program 103(1):127\u2013152","journal-title":"Math Program"},{"key":"59_CR33","doi-asserted-by":"crossref","unstructured":"Ouorou A\u00a0(2020) Proximal bundle algorithms for nonsmooth convex optimization via fast gradient smooth methods. arXiv preprint. arXiv:2003.03437","DOI":"10.1016\/j.orl.2020.09.008"},{"key":"59_CR34","doi-asserted-by":"crossref","unstructured":"Ouorou A (2020) Fast proximal algorithms for nonsmooth convex optimization. arXiv preprint. arXiv:2003.08902","DOI":"10.1016\/j.orl.2020.09.008"},{"issue":"1","key":"59_CR35","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1137\/18M1207685","volume":"30","author":"S Banert","year":"2020","unstructured":"Banert S, Ringh A, Adler J, Karlsson J, Oktem O (2020) Data-driven nonsmooth optimization. SIAM J Optim 30(1):102\u2013131","journal-title":"SIAM J Optim"},{"key":"59_CR36","unstructured":"Zeng X, Chen J (2018) Smooth algorithm for nonsmooth convex optimization using proximal operator and derivative feedback. In: Proc Int Symp Math Theory Netw Syst, pp 805\u2013808"},{"issue":"2","key":"59_CR37","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1137\/110831659","volume":"22","author":"JC Duchi","year":"2012","unstructured":"Duchi JC, Bartlett PL, Wainwright MJ (2012) Randomized smoothing for stochastic optimization. SIAM J Optim 22(2):674\u2013701","journal-title":"SIAM J Optim"},{"key":"59_CR38","unstructured":"Bach F, Moulines E (2013) Non-strongly-convex smooth stochastic approximation with convergence rate o (1\/n). In: Adv Neural Inf Proces Syst, pp 773\u2013781"},{"key":"59_CR39","doi-asserted-by":"publisher","unstructured":"Chen H, He F, Pan Z (2012) Approximation analysis of gradient descent algorithm for bipartite ranking. J Appl Math 2012:13.\u00a0https:\/\/doi.org\/10.1155\/2012\/189753","DOI":"10.1155\/2012\/189753"},{"key":"59_CR40","doi-asserted-by":"crossref","unstructured":"Herbrich R, Graepel T, Obermayer K (2000) Large margin rank boundaries for ordinal regression. In: Smola AJ, Bartlett P, Sch\u00f6lkopf B, Schuurmans D (eds) Advances in Large Margin Classifiers. The MIT Press, pp 115\u2013132","DOI":"10.7551\/mitpress\/1113.003.0010"},{"key":"59_CR41","doi-asserted-by":"crossref","unstructured":"Joachims T (2002) Optimizing search engines using clickthrough data. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 133\u2013142","DOI":"10.1145\/775047.775067"},{"issue":"8","key":"59_CR42","doi-asserted-by":"publisher","first-page":"2165","DOI":"10.1109\/TSP.2004.830991","volume":"52","author":"J Kivinen","year":"2004","unstructured":"Kivinen J, Smola AJ, Williamson RC (2004) Online learning with kernels. IEEE Trans Signal Process 52(8):2165\u20132176","journal-title":"IEEE Trans Signal Process"},{"key":"59_CR43","doi-asserted-by":"crossref","unstructured":"Huang W, Haskell WB\u00a0(2017) Risk-aware q-learning for markov decision processes. In: 2017 IEEE 56th Annual Conference on Decision and Control (CDC), pp 4928\u20134933","DOI":"10.1109\/CDC.2017.8264388"},{"key":"59_CR44","doi-asserted-by":"crossref","unstructured":"Huang W, Haskell WB (2020) Stochastic approximation for risk-aware markov decision processes. IEEE Trans Autom Control","DOI":"10.1109\/TAC.2020.2989702"},{"key":"59_CR45","first-page":"2543","volume":"11","author":"L Xiao","year":"2010","unstructured":"Xiao L (2010) Dual averaging methods for regularized stochastic learning and online optimization. J Mach Learn Res 11:2543\u20132596","journal-title":"J Mach Learn Res"},{"issue":"1\u20132","key":"59_CR46","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10107-016-1030-6","volume":"162","author":"M Schmidt","year":"2017","unstructured":"Schmidt M, Le Roux N, Bach F (2017) Minimizing finite sums with the stochastic average gradient. Math Program 162(1\u20132):83\u2013112","journal-title":"Math Program"},{"issue":"1","key":"59_CR47","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1111\/j.1467-9868.2005.00490.x","volume":"67","author":"R Tibshirani","year":"2005","unstructured":"Tibshirani R, Saunders M, Rosset S, Zhu J, Knight K (2005) Sparsity and smoothness via the fused lasso. J R Stat Soc Ser B Stat Methodol 67(1):91\u2013108","journal-title":"J R Stat Soc Ser B Stat Methodol"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-021-00059-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-021-00059-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-021-00059-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T15:14:11Z","timestamp":1726154051000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-021-00059-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,24]]},"references-count":47,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["59"],"URL":"https:\/\/doi.org\/10.1007\/s43069-021-00059-y","relation":{},"ISSN":["2662-2556"],"issn-type":[{"type":"electronic","value":"2662-2556"}],"subject":[],"published":{"date-parts":[[2021,5,24]]},"assertion":[{"value":"28 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"26"}}