{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T06:15:13Z","timestamp":1790662513696,"version":"4.1.0"},"reference-count":70,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,1,4]],"date-time":"2019-01-04T00:00:00Z","timestamp":1546560000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11501569"],"award-info":[{"award-number":["11501569"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s10107-018-01360-1","type":"journal-article","created":{"date-parts":[[2019,1,3]],"date-time":"2019-01-03T21:13:56Z","timestamp":1546550036000},"page":"371-416","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["New analysis of linear convergence of gradient-type methods via unifying error bound conditions"],"prefix":"10.1007","volume":"180","author":[{"given":"Hui","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,1,4]]},"reference":[{"issue":"15","key":"1360_CR1","first-page":"35","volume":"15","author":"FJA Artacho","year":"2015","unstructured":"Artacho, F.J.A., Geoffroy, M.H.: Metric subregularity of the convex subdifferential in Banach spaces. J. Nonlinear Convex A. 15(15), 35\u201347 (2015)","journal-title":"J. Nonlinear Convex A."},{"key":"1360_CR2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10107-007-0133-5","volume":"116","author":"H Attouch","year":"2009","unstructured":"Attouch, H., Bolte, J.: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features. Math. Program. Ser. B 116, 5\u201316 (2009)","journal-title":"Math. Program. Ser. B"},{"issue":"1\u20132","key":"1360_CR3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward\u2013backward splitting, and regularized Gauss\u2013Seidel methods. Math. Program. Ser. A 137(1\u20132), 91\u2013129 (2013)","journal-title":"Math. Program. Ser. A"},{"issue":"1","key":"1360_CR4","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1137\/17M1114739","volume":"28","author":"H Attouch","year":"2018","unstructured":"Attouch, H., Cabot, A.: Convergence rates of inertial forward\u2013backward algorithms. SIAM J. Optim. 28(1), 849\u2013874 (2018)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1360_CR5","doi-asserted-by":"crossref","first-page":"1824","DOI":"10.1137\/15M1046095","volume":"26","author":"H Attouch","year":"2016","unstructured":"Attouch, H., Peypouquet, J.: The rate of convergence of Nesterov\u2019s accelerated forward\u2013backard method is actually \n$$o(k^{-2})$$\n\n\n\n\no\n(\n\nk\n\n-\n2\n\n\n)\n\n\n\n\n. SIAM J. Optim. 26(3), 1824\u20131834 (2016)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1360_CR6","doi-asserted-by":"crossref","first-page":"1113","DOI":"10.1109\/TAC.2017.2737319","volume":"63","author":"G Banjac","year":"2018","unstructured":"Banjac, G., Margellos, K., Goulart, P.J.: On the convergence of a regularized Jacobi algorithm for convex optimization. IEEE Trans. Autom. Control 63(4), 1113\u20131119 (2018)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1360_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2011","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, Berlin (2011)"},{"issue":"4","key":"1360_CR8","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","volume":"17","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 17(4), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"1360_CR9","volume-title":"Convex Optimization Theory","author":"DP Bertsekas","year":"2011","unstructured":"Bertsekas, D.P.: Convex Optimization Theory. Athena Scientific and Tsinghua University Press, Belmont and Beijing (2011)"},{"issue":"2","key":"1360_CR10","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10107-016-1091-6","volume":"165","author":"J Bolte","year":"2017","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. Math. Program. Ser. A 165(2), 471\u2013507 (2017)","journal-title":"Math. Program. Ser. A"},{"issue":"1\u20132","key":"1360_CR11","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. Ser. A 146(1\u20132), 459\u2013494 (2014)","journal-title":"Math. Program. Ser. A"},{"key":"1360_CR12","unstructured":"Br\u00e9zis, H.: Op\u00e9rateurs maximaux monotones et semi-groupes de contractions dans les espaces de Hilbert. North-Holland Mathematics Studies, vol. 5. North-Holland Publishing Co., Amsterdam-London (1973)"},{"issue":"1","key":"1360_CR13","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0022-1236(75)90027-0","volume":"18","author":"RE Bruck","year":"1975","unstructured":"Bruck, R.E.: Asymptotic convergence of nonlinear contraction semigroups in Hilbert space. J. Funct. Anal. 18(1), 15\u201326 (1975)","journal-title":"J. Funct. Anal."},{"issue":"4","key":"1360_CR14","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1109\/TIT.2015.2399924","volume":"61","author":"EJ Cand\u00e9s","year":"2015","unstructured":"Cand\u00e9s, E.J., Li, X., Soltanolkotabi, M.: Phase retrieval via wirtinger flow: theory and algorithms. IEEE Trans. Inf. Theory 61(4), 1985\u20132007 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1360_CR15","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1017\/S096249291600009X","volume":"25","author":"A Chambolle","year":"2016","unstructured":"Chambolle, A., Pock, T.: An introduction to continuous optimization for imaging. Acta Numer. 25, 161\u2013319 (2016)","journal-title":"Acta Numer."},{"key":"1360_CR16","unstructured":"Cruz, J., Li, G., Nghia, T.: On the Q-linear convergence of forward\u2013backward splitting method and uniqueness of optimal solution to Lasso. Researchgate, November. \narXiv:1806.06333v1\n\n [math.OC] (2018)"},{"key":"1360_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-87821-8","volume-title":"Implicit Functions and Solution Mappings","author":"AL Dontchev","year":"2009","unstructured":"Dontchev, A.L., Rockafellar, R.T.: Implicit Functions and Solution Mappings. Springer, Berlin (2009)"},{"issue":"1\u20132","key":"1360_CR18","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s10107-013-0653-0","volume":"145","author":"Y Drori","year":"2014","unstructured":"Drori, Y., Teboulle, M.: Smooth strongly convex interpolation and exact worst-case performance of first-order methods. Math. Program. Ser. A 145(1\u20132), 451\u2013482 (2014)","journal-title":"Math. Program. Ser. A"},{"key":"1360_CR19","unstructured":"Drusvyatskiy, D., Kempton, C.: An accelerated algorithm for minimizaing convex compositions. \narXiv:1605.00125v1\n\n [math.OC] 30 Apr 2016"},{"key":"1360_CR20","doi-asserted-by":"crossref","unstructured":"Drusvyatskiy, D., Lewis, A.S.: Error bounds, quadratic growth, and linear convergence of proximal methods. Math. Oper. Res. Published online: 15 Mar (2018)","DOI":"10.1287\/moor.2017.0889"},{"issue":"4","key":"1360_CR21","first-page":"1165","volume":"21","author":"D Drusvyatskiy","year":"2014","unstructured":"Drusvyatskiy, D., Mordukhovich, B.S., Nghia, T.T.A.: Second-order growth, tilt stability, and metric regularity of the subdifferential. J. Convex Anal. 21(4), 1165\u20131192 (2014)","journal-title":"J. Convex Anal."},{"key":"1360_CR22","unstructured":"Garrigos, G., Rosasco, L., Villa, S.: Convergence of the forward\u2013backward algorithm: beyond the worst-case with the help of geometry. \narXiv:1703.09477v2\n\n [math.OC] 29 Mar 2017"},{"key":"1360_CR23","unstructured":"Gong, P., Ye, J.: Linear convergence of variance-reduced projected stochastic gradient without strong convexity. \narXiv:1406.1102v2\n\n [cs.NA] 10 July 2015"},{"issue":"3","key":"1360_CR24","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1137\/070698920","volume":"19","author":"ET Hale","year":"2008","unstructured":"Hale, E.T., Yin, W.T., Zhang, Y.: Fixed point continuation for \n$$\\ell _1$$\n\n\n\n\n\u2113\n1\n\n\n\n\n-minimization: methodology and convergence. SIAM J. Optim. 19(3), 1107\u20131130 (2008)","journal-title":"SIAM J. Optim."},{"key":"1360_CR25","doi-asserted-by":"crossref","first-page":"263","DOI":"10.6028\/jres.049.027","volume":"49","author":"A Hoffman","year":"1952","unstructured":"Hoffman, A.: On approximate solutions of systems of linear inequalities. J. Res. Natl. Bur. Stand. 49, 263\u2013265 (1952)","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"1360_CR26","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10107-016-1057-8","volume":"163","author":"M Hong","year":"2017","unstructured":"Hong, M., Wang, X., Razaviyayn, M., Luo, Z.-Q.: Iteration complexity analysis of block coordinate descent methods. Math. Program. Ser. A 163, 85\u2013114 (2017)","journal-title":"Math. Program. Ser. A"},{"key":"1360_CR27","doi-asserted-by":"crossref","unstructured":"Karimi, H., Nutini, J., Schmidt, M.: Linear convergence of proximal-gradient methods under the Polyak\u2013\u0141ojasiewicz condition. \narXiv:1608.04636v1\n\n [cs.LG] 16 Aug 2016 (2016)","DOI":"10.1007\/978-3-319-46128-1_50"},{"key":"1360_CR28","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1007\/978-3-319-46128-1_50","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"Hamed Karimi","year":"2016","unstructured":"Karimi H., Nutini J., Schmidt M.: Linear convergence of gradient and proximal-gradient methods under the Polyak-\u0141ojasiewicz condition. In: Frasconi P., Landwehr N., Manco G., Vreeken J. (eds.) Machine Learning and Knowledge Discovery in Databases. ECML PKDD 2016. Lecture Notes in Computer Science, vol 9851. Springer, Cham (2016)"},{"key":"1360_CR29","unstructured":"Karimi, S., Vavasis, S.: A unified convergence bound for conjugate gradient and accelerated gradient. \narXiv:1605.003200v1\n\n [math.OC] 11 May 2016"},{"issue":"1","key":"1360_CR30","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s10107-015-0949-3","volume":"159","author":"D Kim","year":"2016","unstructured":"Kim, D., Fessler, J.: Optimized first-order methods for smooth convex minimization. Math. Program. Ser. A 159(1), 81\u2013107 (2016)","journal-title":"Math. Program. Ser. A"},{"issue":"2","key":"1360_CR31","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 \n$$\\ell _1$$\n\n\n\n\n\u2113\n1\n\n\n\n\n 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":"1360_CR32","unstructured":"Li, G., Pong, T.K.: Calculus of the exponent of Kurdyka\u2013Lojasiewicz inequality and its applications to linear convergence of first-order methods. Found. Comput. Math. 1\u201334. Published online: 10 Aug (2017)"},{"key":"1360_CR33","unstructured":"Li, X., Zhao, T., Arora, R., Liu, H., Hong, M.: An improved convergence analysis of cyclic block coordinate descent-type methods for strongly convex minimization. \narXiv:1607.02793v1\n\n [math.OC] 10 July 2016"},{"issue":"4","key":"1360_CR34","doi-asserted-by":"crossref","first-page":"2426","DOI":"10.1137\/16M110109X","volume":"27","author":"H Liu","year":"2017","unstructured":"Liu, H., Yue, M.-C., So, A.M.-C.: On the estimation performance and convergence rate of the generalized power method for phase synchronization. SIAM J. Optim. 27(4), 2426\u20132446 (2017)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1360_CR35","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1137\/140961134","volume":"25","author":"J Liu","year":"2015","unstructured":"Liu, J., Wright, S.J.: Asynchronous stochastic coordinate descent: parallelism and convergence properties. SIAM J. Optim. 25(1), 351\u2013376 (2015)","journal-title":"SIAM J. Optim."},{"key":"1360_CR36","first-page":"87","volume":"117","author":"S \u0141ojasiewicz","year":"1963","unstructured":"\u0141ojasiewicz, S.: Une propri\u00e9t\u00e9 topologique des sous-ensembles analytiques r\u00e9els. Colloques internationaux du CNRS 117, 87\u201389 (1963)","journal-title":"Colloques internationaux du CNRS"},{"key":"1360_CR37","doi-asserted-by":"crossref","unstructured":"Luke, D.R., Thao, N.H., Teboulle, M.: Necessary conditions for linear convergence of picard iterations and application to alternating projections. \narXiv:1704.08926v1\n\n [math.OC] 28 Apr 2017","DOI":"10.1007\/s10107-018-1343-8"},{"issue":"2","key":"1360_CR38","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1137\/0330025","volume":"30","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. Control Optim. 30(2), 408\u2013425 (1992)","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"1360_CR39","first-page":"157","volume":"46\u201347","author":"ZQ 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\u201347(1), 157\u2013178 (1993)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"1360_CR40","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0322019","volume":"22","author":"F Luque","year":"1984","unstructured":"Luque, F.: Asymptotic convergence analysis of the proximal point algorithm. SIAM J. Optim. 22(2), 277\u2013293 (1984)","journal-title":"SIAM J. Optim."},{"key":"1360_CR41","unstructured":"Ma, C.X., Gudapati, N.V., Jahani, M., Tappenden, R., Tak\u00e1c\u0306, M.: Underestimate sequences via quadratic averaging. \narXiv:1710.03695\n\n (2017)"},{"key":"1360_CR42","doi-asserted-by":"crossref","unstructured":"Necoara, I., Nesterov, Y., Glineur, F.: Linear convergence of first order methods for non-strongly convex optimization. Math. Program. Ser. A. Published online: 22 Jan (2018)","DOI":"10.1007\/s10107-018-1232-1"},{"key":"1360_CR43","doi-asserted-by":"crossref","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 Academic Publishers, Dordrecht (2004)"},{"key":"1360_CR44","volume-title":"Numerical Optimization","author":"J Nocedal","year":"1997","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (1997)"},{"issue":"4","key":"1360_CR45","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1016\/0041-5553(63)90382-3","volume":"3","author":"BT Polyak","year":"1963","unstructured":"Polyak, B.T.: Gradient methods for the minimisation of functionals. USSR Comput. Math. Math. Phys. 3(4), 864\u2013878 (1963)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"1360_CR46","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/BFb0120929","volume":"14","author":"SM Robinson","year":"1981","unstructured":"Robinson, S.M.: Some continuity properties of polyhedral multifunctions. Math. Program. Study 14, 206\u2013214 (1981)","journal-title":"Math. Program. Study"},{"key":"1360_CR47","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"1360_CR48","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis. Springer, Berlin (1998)"},{"key":"1360_CR49","doi-asserted-by":"crossref","DOI":"10.1515\/9781400841059","volume-title":"Nonlinear Optimization","author":"AP Ruszczy\u0144ski","year":"2006","unstructured":"Ruszczy\u0144ski, A.P.: Nonlinear Optimization, vol. 13. Princeton University Press, Princeton (2006)"},{"issue":"3","key":"1360_CR50","doi-asserted-by":"crossref","first-page":"1883","DOI":"10.1137\/140992990","volume":"26","author":"F Sch\u00f6pfer","year":"2016","unstructured":"Sch\u00f6pfer, F.: Linear convergence of descent methods for the unconstrained minimization of restricted strongly convex functions. SIAM J. Optim. 26(3), 1883\u20131911 (2016)","journal-title":"SIAM J. Optim."},{"key":"1360_CR51","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s13675-015-0048-5","volume":"4","author":"R Shefi","year":"2016","unstructured":"Shefi, R., Teboulle, M.: On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems. EURO J. Comput. Optim. 4, 27\u201346 (2016)","journal-title":"EURO J. Comput. Optim."},{"key":"1360_CR52","unstructured":"So, M.C.: Non-asymptotic convergence analysis of inexact gradient methods for machine learning without strong convexity. \narXiv:1309.0113v1\n\n [math.OC] 31 Aug 2013"},{"key":"1360_CR53","first-page":"1","volume":"17","author":"W Su","year":"2016","unstructured":"Su, W., Boyd, S., Cand\u00e9s, E.J.: A differential equation for modeling Nesterovs accelerated gradient method: theory and insights. J. Mach. Learn. Res. 17, 1\u201313 (2016)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"1360_CR54","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/s10957-018-1298-1","volume":"178","author":"AB Taylor","year":"2018","unstructured":"Taylor, A.B., Hendrickx, J.M., Glineur, F.: Exact worst-case convergence rates of the proximal gradient method for composite convex minimization. J Optim. Theory Appl. 178(2), 455\u2013476 (2018)","journal-title":"J Optim. Theory Appl."},{"issue":"1\u20132","key":"1360_CR55","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10107-016-1009-3","volume":"161","author":"AB Taylor","year":"2017","unstructured":"Taylor, A.B., Hendrickx, J.M., Glineur, F.: Smooth strongly convex interpolation and exact worst-case performance of first-order methods. Math. Program. Ser. A 161(1\u20132), 307\u2013345 (2017)","journal-title":"Math. Program. Ser. A"},{"key":"1360_CR56","unstructured":"Tu, S., Boczar, R., Simchowitz, M., Recht, B.: Low-rank solutions of linear matrix equations via procrustes flow. \narXiv:1507.03566v2\n\n [math.OC] 5 Feb 2016"},{"issue":"2","key":"1360_CR57","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(2), 1523\u20131548 (2014)","journal-title":"J. Mach. Learn. Res."},{"key":"1360_CR58","unstructured":"Wilson, A.C., Recht, B., Jordan, M.I.: A Lyapunov analysis of momentum methods in optimization. \narXiv:1611.02635v1\n\n [math.OC] 8 Nov 2016"},{"issue":"2","key":"1360_CR59","doi-asserted-by":"crossref","first-page":"1062","DOI":"10.1137\/120869997","volume":"23","author":"L Xiao","year":"2013","unstructured":"Xiao, L., Zhang, T.: A proximal-gradient homotopy method for the sparse least-squares problem. SIAM J. Optim. 23(2), 1062\u20131091 (2013)","journal-title":"SIAM J. Optim."},{"key":"1360_CR60","unstructured":"Yang, L., Arora, R., Braverman, V., Zhao, T.: The physical systems behind optimization algorithms. \narXiv:1612.02803v1\n\n [cs.LG] 8 Dec 2016"},{"key":"1360_CR61","unstructured":"Yun, C., Sra, S., Jadbabaie, A.: Global optimality conditions for deep neural networks. \narXiv:1707.02444v1\n\n [cs.LG] 8 July 2017"},{"key":"1360_CR62","unstructured":"Zhang, H.: New analysis of linear convergence of gradient-type methods via unifying error bound conditions. \narXiv:1606.00269v3\n\n [math.OC] 17 Aug 2016"},{"issue":"4","key":"1360_CR63","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1007\/s11590-016-1058-9","volume":"11","author":"H Zhang","year":"2017","unstructured":"Zhang, H.: The restricted strong convexity revisited: analysis of equivalence to error bound and quadratic growth. Optim. Lett. 11(4), 817\u2013833 (2017)","journal-title":"Optim. Lett."},{"issue":"5","key":"1360_CR64","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.: Restricted strong convexity and its applications to convergence analysis of gradient-type methods. Optim. Lett. 9(5), 961\u2013979 (2015)","journal-title":"Optim. Lett."},{"issue":"1","key":"1360_CR65","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s11590-015-0983-3","volume":"11","author":"H Zhang","year":"2017","unstructured":"Zhang, H., Cheng, L.: Projected shrinkage algorithm for box-constrained \n$$\\ell _1$$\n\n\n\n\n\u2113\n1\n\n\n\n\n-minimization. Optim. Lett. 11(1), 55\u201370 (2017)","journal-title":"Optim. Lett."},{"issue":"1","key":"1360_CR66","doi-asserted-by":"crossref","first-page":"103","DOI":"10.4310\/CMS.2015.v13.n1.a5","volume":"13","author":"H Zhang","year":"2015","unstructured":"Zhang, H., Cheng, L., Yin, W.T.: A dual algorithm for a class of augmented convex signal recovery models. Commun. Math. Sci. 13(1), 103\u2013112 (2015)","journal-title":"Commun. Math. Sci."},{"key":"1360_CR67","unstructured":"Zhang, H., Yin, W.T.: Gradient methods for convex minimization: better rates under weaker conditions. Technical report, CAM Report 13-17, UCLA (2013)"},{"key":"1360_CR68","unstructured":"Zhou, Y., Liang, Y.: Characterization of gradient dominance and regularity conditions for neural networks. \narXiv:1710.06910\n\n (2017)"},{"issue":"2","key":"1360_CR69","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1007\/s10107-016-1100-9","volume":"165","author":"Z Zhou","year":"2017","unstructured":"Zhou, Z., So, M.C.: A unified approach to error bounds for structured convex optimization problems. Math. Program. Ser. A 165(2), 689\u2013728 (2017)","journal-title":"Math. Program. Ser. A"},{"key":"1360_CR70","first-page":"203","volume":"4","author":"T Zolezzi","year":"1978","unstructured":"Zolezzi, T.: On equiwellset minimum problems. Appl. Math. Optim. 4, 203\u2013223 (1978)","journal-title":"Appl. Math. Optim."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-01360-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-018-01360-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-01360-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,11]],"date-time":"2020-02-11T05:16:46Z","timestamp":1581398206000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-018-01360-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,4]]},"references-count":70,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["1360"],"URL":"https:\/\/doi.org\/10.1007\/s10107-018-01360-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,4]]},"assertion":[{"value":"28 August 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 December 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}