{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T03:58:07Z","timestamp":1772251087654,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"the National Science Foundation of China","award":["No.11501569"],"award-info":[{"award-number":["No.11501569"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s11590-016-1058-9","type":"journal-article","created":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T07:57:42Z","timestamp":1467359862000},"page":"817-833","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["The restricted strong convexity revisited: analysis of equivalence to error bound and quadratic growth"],"prefix":"10.1007","volume":"11","author":[{"given":"Hui","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,1]]},"reference":[{"issue":"2","key":"1058_CR1","first-page":"365","volume":"15","author":"FJ Arag\u00f3n\u00a0Artacho","year":"2008","unstructured":"Arag\u00f3n\u00a0Artacho, F.J., Geoffroy, M.H.: Characterization of metric regularity of subdifferentials. J. Convex Anal. 15(2), 365\u2013380 (2008)","journal-title":"J. Convex Anal."},{"issue":"1","key":"1058_CR2","doi-asserted-by":"crossref","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":"1058_CR3","unstructured":"Beck, A., Shtern, S.: Linearly convergent away-step conditional gradient for non-strongly convex functions (2015). arXiv:1504.05002v1 [math.OC]"},{"key":"1058_CR4","unstructured":"Bolte, J., Nguyen, T.P., Peypouquet, J., Suter, B.W.: From error bounds to the complexity of first-order descent methods for convex functions (2015). arXiv:1510.08234v1 [math.OC]"},{"key":"1058_CR5","unstructured":"Drusvyatskiy, D., Lewis, A.S.: Error bounds, quadratic growth, and linear convergence of proximal methods (2016). arXiv:1602.06661v1 [math.OC]"},{"key":"1058_CR6","unstructured":"Gong, P.H., Ye, J.P.: Linear convergence of variance-reduced stochastic gradient without strong convexity (2015). arXiv:1406.1102v2 [cs.NA]"},{"key":"1058_CR7","doi-asserted-by":"crossref","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. Bureau Stand. 49, 263\u2013265 (1952)","journal-title":"J. Res. Natl. Bureau Stand."},{"issue":"2","key":"1058_CR8","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1137\/120863290","volume":"6","author":"MJ Lai","year":"2013","unstructured":"Lai, M.J., Yin, W.T.: Augmented $$\\ell _1$$ \u2113 1 and nuclear-norm models with a globally linearly convergent algorithm. SIAM J. Imaging Sci. 6(2), 1059\u20131091 (2013)","journal-title":"SIAM J. Imaging Sci."},{"key":"1058_CR9","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1137\/140961134","volume":"30","author":"J Liu","year":"2015","unstructured":"Liu, J., Wright, S.J.: Asynchronous stochastic coordinate descent: parallelism and convergence properties. SIAM J. Optim. 30, 351\u2013376 (2015)","journal-title":"SIAM J. Optim."},{"key":"1058_CR10","first-page":"408","volume":"117","author":"ZQ Luo","year":"1992","unstructured":"Luo, Z.Q., Tseng, P.: On the linear convergence of descent methods for convex essentially smooth minimization. SIAM J. Optim. 117, 408\u2013425 (1992)","journal-title":"SIAM J. Optim."},{"key":"1058_CR11","unstructured":"So, A.M.-C.: Non-asymptotic convergence analysis of inexact gradient methods for machine learning without strong convexity (2013). arXiv:1309.0113v1 [math.OC]"},{"issue":"3","key":"1058_CR12","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1137\/0325033","volume":"25","author":"OL Mangasarian","year":"1987","unstructured":"Mangasarian, O.L., Shiau, T.-H.: Lipschitz continuity of solutions of linear inequalities, programs and complementarity problems. SIAM J. Control Optim. 25(3), 583\u2013595 (1987)","journal-title":"SIAM J. Control Optim."},{"key":"1058_CR13","unstructured":"Necoara, I., Nesterov, Y., Glineur, F.: Linear convergence of first order methods for non-strongly convex programming (2015). arXiv:1504.06298v3 [math.OC]"},{"key":"1058_CR14","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Kluwer Academic, New York (2004)","DOI":"10.1007\/978-1-4419-8853-9"},{"issue":"69\u201381","key":"1058_CR15","first-page":"1","volume":"6","author":"SM Robinson","year":"1973","unstructured":"Robinson, S.M.: Bounds for error in the solution set of a perturbed linear program. Linear Algebra Appl. 6(69\u201381), 1\u201338 (1973)","journal-title":"Linear Algebra Appl."},{"key":"1058_CR16","doi-asserted-by":"crossref","unstructured":"Ruszczy\u0144ski, A.P.: Nonlinear Optimization, vol. 13. Princeton university press, New Jersy (2006)","DOI":"10.1515\/9781400841059"},{"key":"1058_CR17","unstructured":"Sch $$\\ddot{o}$$ o \u00a8 pfer, F.: Linear convergence of descent methods for the unconstrained minimization of restricted strongly convex functions. SIAM J. Optim. (2015) (submitted)"},{"key":"1058_CR18","first-page":"1523","volume":"15","author":"P Wang","year":"2014","unstructured":"Wang, P., Lin, C.: Iteration complexity of feasiable decent methods for convex optimization. J. Mach. Learn. Res. 15, 1523\u20131548 (2014)","journal-title":"J. Mach. Learn. Res."},{"key":"1058_CR19","unstructured":"Zhang, H., Yin, W.T.: Gradient methods for convex minimization: better rates under weaker conditions. Technical report, CAM Report 13-17, UCLA (2013)"},{"issue":"5","key":"1058_CR20","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1007\/s11590-014-0795-x","volume":"9","author":"H Zhang","year":"2015","unstructured":"Zhang, H., Cheng, L.Z.: Restricted strong convexity and its applications to convergence analysis of gradient-type methods. Optim. Lett. 9(5), 961\u2013979 (2015)","journal-title":"Optim. Lett."},{"key":"1058_CR21","unstructured":"Zhou, Z.R., So, A.M.-C.: A unified approach to error bounds for structured convex optimization problems (2015). arXiv:1512.03518v1 [math.OC]"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1058-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-016-1058-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1058-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1058-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,23]],"date-time":"2020-09-23T05:28:36Z","timestamp":1600838916000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-016-1058-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,1]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["1058"],"URL":"https:\/\/doi.org\/10.1007\/s11590-016-1058-9","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7,1]]}}}