{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T18:02:18Z","timestamp":1780509738129,"version":"3.54.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,1,22]],"date-time":"2018-01-22T00:00:00Z","timestamp":1516579200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100006595","name":"UEFISCDI","doi-asserted-by":"crossref","award":["MOCOBIDS 176\/2015; ScaleFreeNet 39\/2017"],"award-info":[{"award-number":["MOCOBIDS 176\/2015; ScaleFreeNet 39\/2017"]}],"id":[{"id":"10.13039\/501100006595","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s10107-018-1232-1","type":"journal-article","created":{"date-parts":[[2018,1,22]],"date-time":"2018-01-22T07:25:19Z","timestamp":1516605919000},"page":"69-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":159,"title":["Linear convergence of first order methods for non-strongly convex optimization"],"prefix":"10.1007","volume":"175","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1102-2654","authenticated-orcid":false,"given":"I.","family":"Necoara","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu.","family":"Nesterov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"F.","family":"Glineur","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,1,22]]},"reference":[{"issue":"3","key":"1232_CR1","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1287\/moor.1100.0456","volume":"35","author":"D Leventhal","year":"2010","unstructured":"Leventhal, D., Lewis, A.S.: Randomized methods for linear constraints: convergence rates and conditioning. Math. Oper. Res. 35(3), 641\u2013654 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1232_CR2","first-page":"285","volume":"16","author":"J Liu","year":"2015","unstructured":"Liu, J., Wright, S., Re, C., Bittorf, V., Sridhar, S.: An asynchronous parallel stochastic coordinate descent algorithm. J. Mach. Learn. Res. 16(1), 285\u2013322 (2015)","journal-title":"J. Mach. Learn. Res."},{"key":"1232_CR3","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)"},{"issue":"4","key":"1232_CR4","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."},{"issue":"1","key":"1232_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-015-0892-3","volume":"151","author":"S Wright","year":"2015","unstructured":"Wright, S.: Coordinate descent algorithms. Math. Program. 151(1), 3\u201334 (2015)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1232_CR6","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10107-007-0130-8","volume":"116","author":"JV Burke","year":"2009","unstructured":"Burke, J.V., Deng, S.: Weak sharp minima revisited Part III: error bounds for differentiable convex inclusions. Math. Program. 116(1\u20132), 37\u201356 (2009)","journal-title":"Math. Program."},{"key":"1232_CR7","doi-asserted-by":"crossref","unstructured":"Lewis, A.S., Pang, J.S.: Error bounds for convex inequality systems. In: Chapter In: Generalized Convexity, Generalized Monotonicity\u2013Recent Results. Springer, Berlin (1998)","DOI":"10.1007\/978-1-4613-3341-8_3"},{"key":"1232_CR8","unstructured":"Yangy, T., Lin, Q.: A stochastic gradient method with linear convergence rate for a class of non-smooth non-strongly convex optimization. Tech. rep. (2015). \n                    www.arxiv.org"},{"issue":"1","key":"1232_CR9","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02096261","volume":"46","author":"Z-Q Luo","year":"1993","unstructured":"Luo, Z.-Q., Tseng, P.: Error bounds and convergence analysis of feasible descent methods: a general approach. Ann. Oper. Res. 46(1), 157\u2013178 (1993)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"1232_CR10","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1137\/130950288","volume":"26","author":"I Necoara","year":"2016","unstructured":"Necoara, I., Clipici, D.: Parallel random coordinate descent method for composite minimization: convergence analysis and error bounds. SIAM J. Optim. 26(1), 197\u2013226 (2016)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1232_CR11","first-page":"1523","volume":"15","author":"PW Wang","year":"2014","unstructured":"Wang, P.W., Lin, C.J.: Iteration complexity of feasible descent methods for convex optimization. J. Mach. Learn. Res. 15(4), 1523\u20131548 (2014)","journal-title":"J. Mach. Learn. Res."},{"issue":"5","key":"1232_CR12","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1007\/s11590-014-0795-x","volume":"9","author":"H Zhang","year":"2015","unstructured":"Zhang, H., Cheng, L.: Restricted strong convexity and its applications to convergence analysis of gradient type methods in convex optimization. Optim. Lett. 9(5), 961\u2013979 (2015)","journal-title":"Optim. Lett."},{"issue":"1\u20132","key":"1232_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-016-1069-4","volume":"164","author":"A Beck","year":"2017","unstructured":"Beck, A., Shtern, S.: Linearly convergent away-step conditional gradient for non-strongly convex functions. Math. Program. 164(1\u20132), 1\u201327 (2017)","journal-title":"Math. Program."},{"key":"1232_CR14","unstructured":"Drusvyatskiy, D., Lewis, A.: Error bounds, quadratic growth, and linear convergence of proximal methods. Tech. rep., (2016). (\n                    arXiv:1602.06661\n                    \n                  )"},{"issue":"2","key":"1232_CR15","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/s10107-016-1100-9","volume":"165","author":"Z Zhou","year":"2017","unstructured":"Zhou, Z., So, A.: A unified approach to error bounds for structured convex optimization problems. Math. Program. 165(2), 689\u2013728 (2017)","journal-title":"Math. Program."},{"issue":"4","key":"1232_CR16","doi-asserted-by":"publisher","first-page":"263","DOI":"10.6028\/jres.049.027","volume":"49","author":"AJ Hoffman","year":"1952","unstructured":"Hoffman, A.J.: On approximate solutions of systems of linear inequalities. J. Res. Natl. Bur. Stand. 49(4), 263\u2013265 (1952)","journal-title":"J. Res. Natl. Bur. Stand."},{"issue":"2","key":"1232_CR17","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF01432655","volume":"41","author":"D Klatte","year":"1995","unstructured":"Klatte, D., Thiere, G.: Error bounds for solutions of linear equations and inequalities. Math. Methods Oper. Res. 41(2), 191\u2013214 (1995)","journal-title":"Math. Methods Oper. Res."},{"issue":"1","key":"1232_CR18","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":"3","key":"1232_CR19","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/s10208-013-9150-3","volume":"15","author":"B O\u2019Donoghue","year":"2013","unstructured":"O\u2019Donoghue, B., Candes, E.: Adaptive restart for accelerated gradient schemes. Found. Comput. Math. 15(3), 715\u2013732 (2013)","journal-title":"Found. Comput. Math."},{"issue":"3\u20134","key":"1232_CR20","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1561\/2200000050","volume":"8","author":"S Bubeck","year":"2015","unstructured":"Bubeck, S.: Convex optimization: algorithms and complexity. Found. Trends Mach. Learn. 8(3\u20134), 231\u2013357 (2015)","journal-title":"Found. Trends Mach. Learn."},{"issue":"3","key":"1232_CR21","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1007\/s10957-016-0892-3","volume":"169","author":"B O\u2019Donoghue","year":"2016","unstructured":"O\u2019Donoghue, B., Chu, E., Parikh, N., Boyd, S.: Conic optimization via operator splitting and homogeneous self-dual embedding. J. Optim. Theory Appl. 169(3), 1042\u20131068 (2016)","journal-title":"J. Optim. Theory Appl."},{"key":"1232_CR22","unstructured":"Lin, H., Mairal, J., Harchaoui, Z.: A universal Catalyst for first-order optimization. In: Advances in neural information processing systems, 3384\u20133392 (2015)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1232-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-018-1232-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1232-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T12:12:55Z","timestamp":1579263175000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-018-1232-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,22]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["1232"],"URL":"https:\/\/doi.org\/10.1007\/s10107-018-1232-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1,22]]},"assertion":[{"value":"26 July 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}