{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T22:15:00Z","timestamp":1778192100858,"version":"3.51.4"},"reference-count":39,"publisher":"American Mathematical Society (AMS)","issue":"340","license":[{"start":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T00:00:00Z","timestamp":1698451200000},"content-version":"am","delay-in-days":365,"URL":"https:\/\/www.ams.org\/publications\/copyright-and-permissions"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Comp."],"abstract":"<p>The linearized Bregman iterations (LBreI) and its variants have received considerable attention in signal\/image processing and compressed sensing. Recently, LBreI has been extended to a larger class of nonconvex functions, along with several theoretical issues left for further investigation. In particular, the Lipschitz gradient continuity assumption precludes its use in many practical applications. In this study, we propose a generalized algorithmic framework to unify LBreI-type methods. Our main discovery is that the Lipschitz gradient continuity assumption can be replaced by a Lipschitz-like convexity condition in both convex and nonconvex cases. As a by-product, a class of bilevel optimization problems can be solved in the proposed framework, which extends the main result made by Cai et al. [Math. Comp. 78 (2009), pp.\u00a02127\u20132136]. At last, provably convergent iterative schemes on modified linear\/quadratic inverse problems illustrate our finding.<\/p>","DOI":"10.1090\/mcom\/3792","type":"journal-article","created":{"date-parts":[[2022,9,14]],"date-time":"2022-09-14T10:33:14Z","timestamp":1663151594000},"page":"779-803","source":"Crossref","is-referenced-by-count":4,"title":["Revisiting linearized Bregman iterations under Lipschitz-like convexity condition"],"prefix":"10.1090","volume":"92","author":[{"given":"Hui","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Lu","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Hao-Xing","family":"Yang","sequence":"additional","affiliation":[]}],"member":"14","published-online":{"date-parts":[[2022,10,28]]},"reference":[{"issue":"2","key":"1","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1287\/moor.2016.0817","article-title":"A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications","volume":"42","author":"Bauschke, Heinz H.","year":"2017","journal-title":"Math. Oper. Res.","ISSN":"https:\/\/id.crossref.org\/issn\/0364-765X","issn-type":"print"},{"issue":"1","key":"2","first-page":"27","article-title":"Legendre functions and the method of random Bregman projections","volume":"4","author":"Bauschke, Heinz H.","year":"1997","journal-title":"J. Convex Anal.","ISSN":"https:\/\/id.crossref.org\/issn\/0944-6532","issn-type":"print"},{"key":"3","series-title":"MOS-SIAM Series on Optimization","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997.ch1","volume-title":"First-order methods in optimization","volume":"25","author":"Beck, Amir","year":"2017","ISBN":"https:\/\/id.crossref.org\/isbn\/9781611974980"},{"issue":"1-2","key":"4","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-013-0708-2","article-title":"A first order method for finding minimal norm-like solutions of convex optimization problems","volume":"147","author":"Beck, Amir","year":"2014","journal-title":"Math. Program.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5610","issn-type":"print"},{"issue":"2","key":"5","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1137\/20M1357500","article-title":"Choose your path wisely: gradient descent in a Bregman distance framework","volume":"14","author":"Benning, Martin","year":"2021","journal-title":"SIAM J. Imaging Sci."},{"issue":"2-3","key":"6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s10915-012-9650-3","article-title":"Higher-order TV methods\u2014enhancement via Bregman iteration","volume":"54","author":"Benning, Martin","year":"2013","journal-title":"J. Sci. Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/0885-7474","issn-type":"print"},{"issue":"1-2","key":"7","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","article-title":"Proximal alternating linearized minimization for nonconvex and nonsmooth problems","volume":"146","author":"Bolte, J\u00e9r\u00f4me","year":"2014","journal-title":"Math. Program.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5610","issn-type":"print"},{"issue":"3","key":"8","doi-asserted-by":"publisher","first-page":"2131","DOI":"10.1137\/17M1138558","article-title":"First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems","volume":"28","author":"Bolte, J\u00e9r\u00f4me","year":"2018","journal-title":"SIAM J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1052-6234","issn-type":"print"},{"key":"9","first-page":"620","article-title":"A relaxation method of finding a common point of convex sets and its application to the solution of problems in convex programming","volume":"7","author":"Br\u00e8gman, L. M.","year":"1967","journal-title":"\\v{Z}. Vy\\v{c}isl. Mat i Mat. Fiz.","ISSN":"https:\/\/id.crossref.org\/issn\/0044-4669","issn-type":"print"},{"issue":"1","key":"10","doi-asserted-by":"publisher","first-page":"179","DOI":"10.4310\/cms.2006.v4.n1.a7","article-title":"Nonlinear inverse scale space methods","volume":"4","author":"Burger, Martin","year":"2006","journal-title":"Commun. Math. Sci.","ISSN":"https:\/\/id.crossref.org\/issn\/1539-6746","issn-type":"print"},{"issue":"4","key":"11","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","article-title":"A singular value thresholding algorithm for matrix completion","volume":"20","author":"Cai, Jian-Feng","year":"2010","journal-title":"SIAM J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1052-6234","issn-type":"print"},{"issue":"267","key":"12","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1090\/S0025-5718-08-02189-3","article-title":"Linearized Bregman iterations for compressed sensing","volume":"78","author":"Cai, Jian-Feng","year":"2009","journal-title":"Math. Comp.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5718","issn-type":"print"},{"issue":"1","key":"13","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1137\/080733371","article-title":"Linearized Bregman iterations for frame-based image deblurring","volume":"2","author":"Cai, Jian-Feng","year":"2009","journal-title":"SIAM J. Imaging Sci."},{"issue":"268","key":"14","doi-asserted-by":"publisher","first-page":"2127","DOI":"10.1090\/S0025-5718-09-02242-X","article-title":"Convergence of the linearized Bregman iteration for \u2113\u2081-norm minimization","volume":"78","author":"Cai, Jian-Feng","year":"2009","journal-title":"Math. Comp.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5718","issn-type":"print"},{"issue":"3","key":"15","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1137\/0803026","article-title":"Convergence analysis of a proximal-like minimization algorithm using Bregman functions","volume":"3","author":"Chen, Gong","year":"1993","journal-title":"SIAM J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1052-6234","issn-type":"print"},{"issue":"1","key":"16","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/S003614450037906X","article-title":"Atomic decomposition by basis pursuit","volume":"43","author":"Chen, Scott Shaobing","year":"2001","journal-title":"SIAM Rev.","ISSN":"https:\/\/id.crossref.org\/issn\/1095-7200","issn-type":"print"},{"issue":"2","key":"17","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1287\/moor.22.2.326","article-title":"Free-steering relaxation methods for problems with strictly convex costs and linear constraints","volume":"22","author":"Kiwiel, Krzysztof C.","year":"1997","journal-title":"Math. Oper. Res.","ISSN":"https:\/\/id.crossref.org\/issn\/0364-765X","issn-type":"print"},{"key":"18","unstructured":"J. Darbon and S. Osher, Fast discrete optimization for sparse approximations and deconvolutions, 2007, preprint."},{"issue":"4","key":"19","doi-asserted-by":"publisher","first-page":"1142","DOI":"10.1137\/S0363012995281742","article-title":"Proximal minimization methods with generalized Bregman functions","volume":"35","author":"Kiwiel, Krzysztof C.","year":"1997","journal-title":"SIAM J. Control Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/0363-0129","issn-type":"print"},{"issue":"2","key":"20","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1137\/120863290","article-title":"Augmented \u2113\u2081 and nuclear-norm models with a globally linearly convergent algorithm","volume":"6","author":"Lai, Ming-Jun","year":"2013","journal-title":"SIAM J. Imaging Sci."},{"issue":"2","key":"21","doi-asserted-by":"publisher","first-page":"1237","DOI":"10.1137\/130936269","article-title":"The linearized Bregman method via split feasibility problems: analysis and generalizations","volume":"7","author":"Lorenz, Dirk A.","year":"2014","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"22","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1137\/16M1099546","article-title":"Relatively smooth convex optimization by first-order methods, and applications","volume":"28","author":"Lu, Haihao","year":"2018","journal-title":"SIAM J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1052-6234","issn-type":"print"},{"key":"23","unstructured":"D. R. Luke, Phase retrieval, what\u2019s new?, SIAG\/OPTViewsNews 25 (2017), 1\u20135."},{"issue":"4","key":"24","doi-asserted-by":"publisher","first-page":"2771","DOI":"10.1137\/130943388","article-title":"Color Bregman TV","volume":"7","author":"Moeller, Michael","year":"2014","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"25","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1137\/S1052623403425629","article-title":"Prox-method with rate of convergence \ud835\udc42(1\/\ud835\udc61) for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems","volume":"15","author":"Nemirovski, Arkadi","year":"2004","journal-title":"SIAM J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1052-6234","issn-type":"print"},{"issue":"2","key":"26","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1137\/040605412","article-title":"An iterative regularization method for total variation-based image restoration","volume":"4","author":"Osher, Stanley","year":"2005","journal-title":"Multiscale Model. Simul.","ISSN":"https:\/\/id.crossref.org\/issn\/1540-3459","issn-type":"print"},{"key":"27","series-title":"Translations Series in Mathematics and Engineering","isbn-type":"print","volume-title":"Introduction to optimization","author":"Polyak, Boris T.","year":"1987","ISBN":"https:\/\/id.crossref.org\/isbn\/0911575146"},{"key":"28","series-title":"Princeton Mathematical Series, No. 28","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"Rockafellar, R. Tyrrell","year":"1970"},{"key":"29","volume-title":"Principles of mathematical analysis","author":"Rudin, Walter","year":"1953"},{"issue":"2","key":"30","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1137\/16M105592X","article-title":"A first order method for solving convex bilevel optimization problems","volume":"27","author":"Sabach, Shoham","year":"2017","journal-title":"SIAM J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1052-6234","issn-type":"print"},{"issue":"1","key":"31","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s10107-018-1284-2","article-title":"A simplified view of first order methods for optimization","volume":"170","author":"Teboulle, Marc","year":"2018","journal-title":"Math. Program.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5610","issn-type":"print"},{"issue":"2","key":"32","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1109\/TIP.2006.888335","article-title":"Iterative regularization and nonlinear inverse scale space applied to wavelet-based denoising","volume":"16","author":"Xu, Jinjun","year":"2007","journal-title":"IEEE Trans. Image Process.","ISSN":"https:\/\/id.crossref.org\/issn\/1057-7149","issn-type":"print"},{"issue":"4","key":"33","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1137\/090760350","article-title":"Analysis and generalizations of the linearized Bregman model","volume":"3","author":"Yin, Wotao","year":"2010","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"34","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1137\/070703983","article-title":"Bregman iterative algorithms for \ud835\udc59\u2081-minimization with applications to compressed sensing","volume":"1","author":"Yin, Wotao","year":"2008","journal-title":"SIAM J. Imaging Sci."},{"issue":"1-2","key":"35","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10107-018-01360-1","article-title":"New analysis of linear convergence of gradient-type methods via unifying error bound conditions","volume":"180","author":"Zhang, Hui","year":"2020","journal-title":"Math. Program.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5610","issn-type":"print"},{"issue":"1","key":"36","doi-asserted-by":"publisher","first-page":"103","DOI":"10.4310\/CMS.2015.v13.n1.a5","article-title":"A dual algorithm for a class of augmented convex signal recovery models","volume":"13","author":"Zhang, Hui","year":"2015","journal-title":"Commun. Math. Sci.","ISSN":"https:\/\/id.crossref.org\/issn\/1539-6746","issn-type":"print"},{"key":"37","unstructured":"H. Zhang and Y. H. Dai, Mirror frameworks for relatively Lipschitz and monotone-like variational inequalities,  arXiv:2108.12070 [math.OC], 2021."},{"key":"38","unstructured":"H. Zhang and W. Yin, Gradient methods for convex minimization: better rates under weaker conditions, CAM Report 13-17, UCLA, 2013."},{"issue":"3","key":"39","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1137\/090746379","article-title":"Bregmanized nonlocal regularization for deconvolution and sparse reconstruction","volume":"3","author":"Zhang, Xiaoqun","year":"2010","journal-title":"SIAM J. Imaging Sci."}],"container-title":["Mathematics of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.ams.org\/mcom\/2023-92-340\/S0025-5718-2022-03792-3\/S0025-5718-2022-03792-3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T04:49:50Z","timestamp":1776833390000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/mcom\/2023-92-340\/S0025-5718-2022-03792-3\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,28]]},"references-count":39,"journal-issue":{"issue":"340","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["S0025-5718-2022-03792-3"],"URL":"https:\/\/doi.org\/10.1090\/mcom\/3792","archive":["CLOCKSS","Portico"],"relation":{},"ISSN":["1088-6842","0025-5718"],"issn-type":[{"value":"1088-6842","type":"electronic"},{"value":"0025-5718","type":"print"}],"subject":[],"published":{"date-parts":[[2022,10,28]]}}}