{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T18:48:26Z","timestamp":1778006906674,"version":"3.51.4"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,4,5]],"date-time":"2019-04-05T00:00:00Z","timestamp":1554422400000},"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,9]]},"DOI":"10.1007\/s10957-019-01516-9","type":"journal-article","created":{"date-parts":[[2019,4,5]],"date-time":"2019-04-05T16:28:38Z","timestamp":1554481718000},"page":"1068-1087","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["On Linear Convergence of Non-Euclidean Gradient Methods without Strong Convexity and Lipschitz Gradient Continuity"],"prefix":"10.1007","volume":"182","author":[{"given":"Heinz H.","family":"Bauschke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00f4me","family":"Bolte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiawei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Teboulle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianfu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,5]]},"reference":[{"key":"1516_CR1","volume-title":"Convex Optimization in Signal Processing and Communications","year":"2010","unstructured":"Palomar, D.P., Eldar, Y.C. (eds.): Convex Optimization in Signal Processing and Communications. Cambridge University Press, New York (2010)"},{"key":"1516_CR2","volume-title":"Optimization for Machine Learning","year":"2011","unstructured":"Sra, S., Nowozin, S., Wright, S.J. (eds.): Optimization for Machine Learning. MIT Press, Cambridge (2011)"},{"key":"1516_CR3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First-Order Methods in Optimization, MOS-SIAM Series on Optimization, MO25","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-Order Methods in Optimization, MOS-SIAM Series on Optimization, MO25. SIAM, Philadelphia (2017)"},{"key":"1516_CR4","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (1999)","edition":"2"},{"key":"1516_CR5","first-page":"643","volume":"3","author":"BT Polyak","year":"1963","unstructured":"Polyak, B.T.: Gradient methods for minimizing functionals. Zh. Vychisl. Mat. Mat. Fiz. 3, 643\u2013653 (1963). (in Russian)","journal-title":"Zh. Vychisl. Mat. Mat. Fiz."},{"key":"1516_CR6","unstructured":"\u0141ojasiewicz, S.: Une propri\u00e9t\u00e9 topologique des sous-ensembles analytiques r\u00e9els. In Les \u00c9quations aux Deriv\u00e9es Partielles, \u00c9ditions du Centre National de la Recherche Scientifique, Paris, pp. 87\u201389 (1963)"},{"key":"1516_CR7","unstructured":"\u0141ojasiewicz, S.: Ensembles semi-analytiques, Cours mim\u00e9ographi\u00e9 de la Facult\u00e9 des Sciences d\u2019Orsay, I.H.E.S., Bures-sur-Yvette (1965). \n                    http:\/\/perso.univ-rennes1.fr\/michel.coste\/Lojasiewicz.pdf"},{"key":"1516_CR8","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1137\/050644641","volume":"17","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A.S.: The \u0141ojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems. SIAM J. Optim. 17, 1205\u20131223 (2007)","journal-title":"SIAM J. Optim."},{"key":"1516_CR9","doi-asserted-by":"publisher","first-page":"2131","DOI":"10.1137\/17M1138558","volume":"28","author":"J Bolte","year":"2018","unstructured":"Bolte, J., Sabach, S., Teboulle, M., Vaisbourd, Y.: First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems. SIAM J. Optim. 28, 2131\u20132151 (2018)","journal-title":"SIAM J. Optim."},{"key":"1516_CR10","doi-asserted-by":"publisher","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, 471\u2013507 (2017)","journal-title":"Math. Program. Ser. A"},{"key":"1516_CR11","doi-asserted-by":"publisher","first-page":"123006","DOI":"10.1088\/0266-5611\/25\/12\/123006","volume":"25","author":"M Bertero","year":"2009","unstructured":"Bertero, M., Boccacci, P., Desider, G., Vicidomini, G.: Image deblurring with Poisson data: from cells to galaxies. Inverse Probl. 25, 123006 (2009)","journal-title":"Inverse Probl."},{"key":"1516_CR12","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1287\/moor.2016.0817","volume":"42","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Bolte, J., Teboulle, M.: A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications. Math. Oper. Res. 42, 330\u2013348 (2017)","journal-title":"Math. Oper. Res."},{"key":"1516_CR13","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"LM Bregman","year":"1967","unstructured":"Bregman, L.M.: 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, 200\u2013217 (1967)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"1516_CR14","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s10013-016-0238-3","volume":"45","author":"QV Nguyen","year":"2017","unstructured":"Nguyen, Q.V.: Forward\u2013backward splitting with Bregman distances. Vietnam J. Math. 45, 519\u2013539 (2017)","journal-title":"Vietnam J. Math."},{"key":"1516_CR15","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s10107-018-1284-2","volume":"170","author":"M Teboulle","year":"2018","unstructured":"Teboulle, M.: A simplified view of first order methods for optimization. Math. Program. Ser. B 170, 67\u201396 (2018)","journal-title":"Math. Program. Ser. B"},{"key":"1516_CR16","first-page":"65","volume-title":"Advances Neural Information Processing Systems","author":"PL Bartlett","year":"2007","unstructured":"Bartlett, P.L., Hazan, E., Rakhlin, A.: Adaptive online gradient descent. In: Platt, J., Koller, D., Singer, Y., Roweis, S. (eds.) Advances Neural Information Processing Systems, vol. 20, pp. 65\u201372. MIT Press, Cambridge (2007)"},{"key":"1516_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edn. Springer, New York (2017)","edition":"2"},{"key":"1516_CR18","doi-asserted-by":"publisher","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":"1516_CR19","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, corrected 3rd printing (2009)"},{"key":"1516_CR20","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"HH Bauschke","year":"1996","unstructured":"Bauschke, H.H., Borwein, J.M.: On projection algorithms for solving convex feasibility problems. SIAM Rev. 38, 367\u2013426 (1996)","journal-title":"SIAM Rev."},{"key":"1516_CR21","first-page":"27","volume":"4","author":"HH Bauschke","year":"1997","unstructured":"Bauschke, H.H., Borwein, J.M.: Legendre functions and the method of random Bregman projections. J. Convex Anal. 4, 27\u201367 (1997)","journal-title":"J. Convex Anal."},{"key":"1516_CR22","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S1570-579X(01)80004-5","volume-title":"Inherently Parallel Algorithms in Feasibility and Optimization and their Applications (Haifa 2000)","author":"HH Bauschke","year":"2001","unstructured":"Bauschke, H.H., Borwein, J.M.: Joint and separate convexity of the Bregman distance. In: Butnariu, D., Censor, Y., Reich, S. (eds.) Inherently Parallel Algorithms in Feasibility and Optimization and their Applications (Haifa 2000), pp. 23\u201336. Elsevier, Amsterdam (2001)"},{"key":"1516_CR23","doi-asserted-by":"publisher","first-page":"1266","DOI":"10.1137\/S0363012902410861","volume":"42","author":"J Bolte","year":"2003","unstructured":"Bolte, J., Teboulle, M.: Barrier operators and associated gradient like dynamical systems for constrained minimization problems. SIAM J. Control Optim. 42, 1266\u20131292 (2003)","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"1516_CR24","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1137\/S1052623495286302","volume":"8","author":"R Burachik","year":"1998","unstructured":"Burachik, R., Iusem, A.: A generalized proximal point algorithm for the variational inequality problem in a Hilbert space. SIAM J. Optim. 8(1), 197\u2013216 (1998)","journal-title":"SIAM J. Optim."},{"key":"1516_CR25","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/BF00940051","volume":"73","author":"Y Censor","year":"1992","unstructured":"Censor, Y., Zenios, S.A.: Proximal minimization algorithm with D-functions. J. Optim. Theory Appl. 73, 451\u2013464 (1992)","journal-title":"J. Optim. Theory Appl."},{"key":"1516_CR26","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1137\/0803026","volume":"3","author":"G Chen","year":"1993","unstructured":"Chen, G., Teboulle, M.: Convergence analysis of a proximal-like minimization algorithm using Bregman functions. SIAM J. Optim. 3, 538\u2013543 (1993)","journal-title":"SIAM J. Optim."},{"key":"1516_CR27","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1287\/moor.18.1.202","volume":"18","author":"J Eckstein","year":"1993","unstructured":"Eckstein, J.: Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming. Math. Oper. Res. 18, 202\u2013226 (1993)","journal-title":"Math. Oper. Res."},{"key":"1516_CR28","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1137\/0801025","volume":"1","author":"A Iusem","year":"1991","unstructured":"Iusem, A.: On dual convergence and the rate of primal convergence of Bregman convex programming method. SIAM J. Optim. 1, 401\u2013423 (1991)","journal-title":"SIAM J. Optim."},{"key":"1516_CR29","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1287\/moor.17.3.670","volume":"17","author":"M Teboulle","year":"1992","unstructured":"Teboulle, M.: Entropic proximal mappings with application to nonlinear programming. Math. Oper. Res. 17, 670\u2013690 (1992)","journal-title":"Math. Oper. Res."},{"key":"1516_CR30","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, 697\u2013725 (2006)","journal-title":"SIAM J. Optim."},{"key":"1516_CR31","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10107-007-0147-z","volume":"120","author":"A Auslender","year":"2009","unstructured":"Auslender, A., Teboulle, M.: Projected subgradient methods with non-Euclidean distances for nondifferentiable convex minimization and variational inequalities. Math. Program. Ser. B 120, 27\u201348 (2009)","journal-title":"Math. Program. Ser. B"},{"key":"1516_CR32","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0167-6377(02)00231-6","volume":"31","author":"A Beck","year":"2003","unstructured":"Beck, A., Teboulle, M.: Mirror descent and nonlinear projected subgradient methods for convex optimization. Oper. Res. Lett. 31, 167\u2013175 (2003)","journal-title":"Oper. Res. Lett."},{"key":"1516_CR33","volume-title":"Problem Complexity and Method Efficiency in Optimization","year":"1983","unstructured":"Nemirovsky, A.S., Yudin, D.B. (eds.): Problem Complexity and Method Efficiency in Optimization. Wiley, New York (1983)"},{"key":"#cr-split#-1516_CR34.1","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley, New York (1983)"},{"key":"#cr-split#-1516_CR34.2","unstructured":"Republished as Classics in Applied Mathematics, vol. 5. SIAM, Philadelphia (1990)"},{"key":"1516_CR35","unstructured":"Zhang, H., Dai, Y.-H., Guo, L.: Proximal-like incremental aggregated gradient method with linear convergence under Bregman distance growth conditions. \n                    arXiv:1711.01136"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-019-01516-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-019-01516-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-019-01516-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T23:20:48Z","timestamp":1585956048000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-019-01516-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,5]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["1516"],"URL":"https:\/\/doi.org\/10.1007\/s10957-019-01516-9","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,5]]},"assertion":[{"value":"23 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 April 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}