{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:46:21Z","timestamp":1740123981849,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,1,16]],"date-time":"2019-01-16T00:00:00Z","timestamp":1547596800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s10957-018-01469-5","type":"journal-article","created":{"date-parts":[[2019,1,16]],"date-time":"2019-01-16T00:40:12Z","timestamp":1547599212000},"page":"541-566","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Accelerated Randomized Mirror Descent Algorithms for Composite Non-strongly Convex Optimization"],"prefix":"10.1007","volume":"181","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2532-4637","authenticated-orcid":false,"given":"Le Thi Khanh","family":"Hien","sequence":"first","affiliation":[]},{"given":"Cuong V.","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Huan","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Canyi","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Jiashi","family":"Feng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,16]]},"reference":[{"issue":"2","key":"1469_CR1","first-page":"543","volume":"27","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate \n                    \n                      \n                    \n                    $$\\text{ O }(1\/k^2)$$\n                    \n                      \n                        \n                          \n                          O\n                          \n                          (\n                          1\n                          \/\n                          \n                            k\n                            2\n                          \n                          )\n                        \n                      \n                    \n                  . Sov. Math. Dokl. 27(2), 543\u2013547 (1983)","journal-title":"Sov. Math. Dokl."},{"key":"1469_CR2","first-page":"509","volume":"24","author":"Y Nesterov","year":"1998","unstructured":"Nesterov, Y.: On an approach to the construction of optimal methods of minimization of smooth convex functions. Ekonom. i. Mat. Metody 24, 509\u2013517 (1998)","journal-title":"Ekonom. i. Mat. Metody"},{"issue":"1","key":"1469_CR3","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. 103(1), 127\u2013152 (2005)","journal-title":"Math. Program."},{"issue":"1","key":"1469_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program. 140(1), 125\u2013161 (2013)","journal-title":"Math. Program."},{"issue":"1","key":"1469_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/090756855","volume":"4","author":"S Becker","year":"2011","unstructured":"Becker, S., Bobin, J., Cand\u00e8s, E.J.: NESTA: a fast and accurate first-order method for sparse recovery. SIAM J. Imaging Sci. 4(1), 1\u201339 (2011)","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"1469_CR6","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/060670985","volume":"30","author":"A d\u2019Aspremont","year":"2008","unstructured":"d\u2019Aspremont, A., Banerjee, O., Ghaoui, L.E.: First-order methods for sparse covariance selection. SIAM J. Matrix Anal. Appl. 30(1), 56\u201366 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"1469_CR7","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1137\/S1052623403427823","volume":"16","author":"A Auslender","year":"2006","unstructured":"Auslender, A., Teboulle, M.: Interior gradient and proximal methods for convex and conic optimization. SIAM J. Optim. 16(3), 697\u2013725 (2006)","journal-title":"SIAM J. Optim."},{"key":"1469_CR8","unstructured":"Tseng, P.: On Accelerated Proximal Gradient Methods for Convex\u2013Concave Optimization. Technical report (2008)"},{"issue":"4","key":"1469_CR9","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A Nemirovski","year":"2009","unstructured":"Nemirovski, A., Juditsky, A., Lan, G., Shapiro, A.: Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19(4), 1574\u20131609 (2009)","journal-title":"SIAM J. Optim."},{"key":"1469_CR10","unstructured":"Roux, N.L., Schmidt, M., Bach, F.R.: A stochastic gradient method with an exponential convergence rate for finite training sets. In: Advances in Neural Information Processing Systems, pp. 2663\u20132671 (2012)"},{"key":"1469_CR11","unstructured":"Johnson, R., Zhang, T.: Accelerating stochastic gradient descent using predictive variance reduction. In: Advances in Neural Information Processing Systems, pp. 315\u2013323 (2013)"},{"key":"1469_CR12","doi-asserted-by":"publisher","first-page":"2057","DOI":"10.1137\/140961791","volume":"24","author":"L Xiao","year":"2014","unstructured":"Xiao, L., Zhang, T.: A proximal stochastic gradient method with progressive variance reduction. SIAM J. Optim. 24, 2057\u20132075 (2014)","journal-title":"SIAM J. Optim."},{"key":"1469_CR13","unstructured":"Nguyen, L.M., Liu, J., Scheinberg, K., Tak\u00e1\u010d, M.: SARAH: a novel method for machine learning problems using stochastic recursive gradient. In: International Conference on Machine Learning, pp. 2613\u20132621 (2017)"},{"issue":"4","key":"1469_CR14","doi-asserted-by":"publisher","first-page":"1997","DOI":"10.1137\/130949993","volume":"25","author":"O Fercoq","year":"2015","unstructured":"Fercoq, O., Richt\u00e1rik, P.: Accelerated, parallel, and proximal coordinate descent. SIAM J. Optim. 25(4), 1997\u20132023 (2015)","journal-title":"SIAM J. Optim."},{"key":"1469_CR15","unstructured":"Lin, H., Mairal, J., Harchaoui, Z.: A universal catalyst for first-order optimization. In: Advances in Neural Information Processing Systems, pp. 3384\u20133392 (2015)"},{"issue":"3","key":"1469_CR16","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 127\u2013239 (2014)","journal-title":"Found. Trends Optim."},{"issue":"4","key":"1469_CR17","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"JF Cai","year":"2010","unstructured":"Cai, J.F., Cand\u00e8s, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20(4), 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1469_CR18","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1109\/TIP.2010.2072512","volume":"20","author":"JM Fadili","year":"2011","unstructured":"Fadili, J.M., Peyre, G.: Total variation projection with first order schemes. IEEE Trans. Image Process. 20(3), 657\u2013669 (2011)","journal-title":"IEEE Trans. Image Process."},{"issue":"1","key":"1469_CR19","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10107-009-0306-5","volume":"128","author":"S Ma","year":"2011","unstructured":"Ma, S., Goldfarb, D., Chen, L.: Fixed point and Bregman iterative methods for matrix rank minimization. Math. Program. 128(1), 321\u2013353 (2011)","journal-title":"Math. Program."},{"issue":"5","key":"1469_CR20","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14(5), 877\u2013898 (1976)","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"1469_CR21","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10107-013-0677-5","volume":"146","author":"O Devolder","year":"2014","unstructured":"Devolder, O., Glineur, F., Nesterov, Y.: First-order methods of smooth convex optimization with inexact oracle. Math. Program. 146(1), 37\u201375 (2014)","journal-title":"Math. Program."},{"key":"1469_CR22","unstructured":"Schmidt, M., Roux, N.L., Bach, F.R.: Convergence rates of inexact proximal-gradient methods for convex optimization. In: Advances in Neural Information Processing Systems, pp. 1458\u20131466 (2011)"},{"issue":"2","key":"1469_CR23","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s101070050022","volume":"88","author":"M Solodov","year":"2000","unstructured":"Solodov, M., Svaiter, B.: Error bounds for proximal point subproblems and associated inexact proximal point algorithms. Math. Program. 88(2), 371\u2013389 (2000)","journal-title":"Math. Program."},{"issue":"3","key":"1469_CR24","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1137\/110844805","volume":"23","author":"S Villa","year":"2013","unstructured":"Villa, S., Salzo, S., Baldassarre, L., Verri, A.: Accelerated and inexact forward\u2013backward algorithms. SIAM J. Optim. 23(3), 1607\u20131633 (2013)","journal-title":"SIAM J. Optim."},{"key":"1469_CR25","doi-asserted-by":"crossref","unstructured":"Allen-Zhu, Z.K.: The first direct acceleration of stochastic gradient methods. In: ACM SIGACT Symposium on Theory of Computing (2017)","DOI":"10.1145\/3055399.3055448"},{"issue":"3","key":"1469_CR26","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"L Bregman","year":"1967","unstructured":"Bregman, L.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. Math. Phys. 7(3), 200\u2013217 (1967)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"4","key":"1469_CR27","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1137\/S1052623495292130","volume":"7","author":"M Teboulle","year":"1997","unstructured":"Teboulle, M.: Convergence of proximal-like algorithms. SIAM J. Optim. 7(4), 1069\u20131083 (1997)","journal-title":"SIAM J. Optim."},{"key":"1469_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Kluwer, Dordrecht (2004)"},{"key":"1469_CR29","first-page":"102","volume-title":"Numerical Methods for Nondifferentiable Convex Optimization","author":"A Auslender","year":"1987","unstructured":"Auslender, A.: Numerical Methods for Nondifferentiable Convex Optimization, pp. 102\u2013126. Springer, Berlin (1987)"},{"issue":"1","key":"1469_CR30","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1011215321374","volume":"20","author":"YJ Lee","year":"2001","unstructured":"Lee, Y.J., Mangasarian, O.: SSVM: a smooth support vector machine for classification. Comput. Optim. Appl. 20(1), 5\u201322 (2001)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1469_CR31","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"1469_CR32","unstructured":"Defazio, A., Bach, F., Lacoste-julien, S.: SAGA: a fast incremental gradient method with support for non-strongly convex composite objectives. In: Advances in Neural Information Processing Systems, pp. 1646\u20131654 (2014)"},{"key":"1469_CR33","unstructured":"Fan, R.E., Lin, C.J.: LIBSVM Data: Classification, Regression and Multi-Label. \n                    http:\/\/www.csie.ntu.edu.tw\/~cjlin\/libsvmtools\/datasets\n                    \n                   (2011). Accessed 01 April 2018"},{"key":"1469_CR34","doi-asserted-by":"crossref","unstructured":"Jacob, L., Obozinski, G., Vert, J.P.: Group Lasso with overlap and graph Lasso. In: International Conference on Machine Learning, pp. 433\u2013440 (2009)","DOI":"10.1145\/1553374.1553431"},{"key":"1469_CR35","unstructured":"Mosci, S., Villa, S., Verri, A., Rosasco, L.: A primal\u2013dual algorithm for group sparse regularization with overlapping groups. In: Advances in Neural Information Processing Systems, pp. 2604\u20132612 (2010)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-018-01469-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-018-01469-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-018-01469-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,15]],"date-time":"2020-01-15T19:22:08Z","timestamp":1579116128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-018-01469-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,16]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["1469"],"URL":"https:\/\/doi.org\/10.1007\/s10957-018-01469-5","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2019,1,16]]},"assertion":[{"value":"16 April 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 December 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}