{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T19:40:19Z","timestamp":1754163619877,"version":"3.41.2"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T00:00:00Z","timestamp":1751587200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T00:00:00Z","timestamp":1751587200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100008769","name":"Julius-Maximilians-Universit\u00e4t W\u00fcrzburg","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100008769","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2025,10]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>We consider the composite minimization problem with the objective function being the sum of a continuously differentiable and a merely lower semicontinuous and extended-valued function. The proximal gradient method is probably the most popular solver for this class of problems. Its convergence theory typically requires that either the gradient of the smooth part of the objective function is globally Lipschitz continuous or the (implicit or explicit) a priori assumption that the iterates generated by this method are bounded. Some recent results show that, without these assumptions, the proximal gradient method, combined with a monotone stepsize strategy, is still globally convergent with a suitable rate-of-convergence under the Kurdyka-\u0141ojasiewicz property. For a nonmonotone stepsize strategy, there exist some attempts to verify similar convergence results, but, so far, they need stronger assumptions. This paper is the first which shows that nonmonotone proximal gradient methods for composite optimization problems share essentially the same nice global and rate-of-convergence properties as its monotone counterparts, still without assuming a global Lipschitz assumption and without an a priori knowledge of the boundedness of the iterates.<\/jats:p>","DOI":"10.1007\/s10957-025-02762-w","type":"journal-article","created":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T04:25:18Z","timestamp":1751603118000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Convergence of Nonmonotone Proximal Gradient Methods under the Kurdyka-\u0141ojasiewicz Property without a Global Lipschitz Assumption"],"prefix":"10.1007","volume":"207","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2897-2509","authenticated-orcid":false,"given":"Christian","family":"Kanzow","sequence":"first","affiliation":[]},{"given":"Leo","family":"Lehmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,4]]},"reference":[{"issue":"2","key":"2762_CR1","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1137\/040605266","volume":"16","author":"P-A Absil","year":"2005","unstructured":"Absil, P.-A., Mahony, R., Andrews, B.: Convergence of the iterates of descent methods for analytic cost functions. In: SIAM Journal on Optimization 16(2), 531\u2013547 (2005). https:\/\/doi.org\/10.1137\/040605266","journal-title":"In: SIAM Journal on Optimization"},{"issue":"1","key":"2762_CR2","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10107-017-1180-1","volume":"169","author":"FJ Arag\u00f3n Artacho","year":"2018","unstructured":"Arag\u00f3n Artacho, F.J., Fleming, R.M.T., Vuong, P.T.: Accelerating the DC algorithm for smooth functions. In: Mathematical Programming 169(1), 95\u2013118 (2018). https:\/\/doi.org\/10.1007\/s10107-017-1180-1","journal-title":"In: Mathematical Programming"},{"issue":"1","key":"2762_CR3","doi-asserted-by":"publisher","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. In: Mathematical Programming 116(1), 5\u201316 (2009). https:\/\/doi.org\/10.1007\/s10107-007-0133-5","journal-title":"In: Mathematical Programming"},{"issue":"2","key":"2762_CR4","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: An approach based on the Kurdyka-\u0141ojasiewicz inequality. In: Mathematics of Operations Research 35(2), 438\u2013457 (2010). https:\/\/doi.org\/10.1287\/moor.1100.0449","journal-title":"In: Mathematics of Operations Research"},{"key":"2762_CR5","doi-asserted-by":"publisher","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-backward splitting, and regularized Gauss-Seidel methods. Math. Program. 137, 91\u2013129 (2013). https:\/\/doi.org\/10.1007\/s10107-011-0484-9","journal-title":"Math. Program."},{"issue":"2","key":"2762_CR6","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. In: Mathematics of Operations Research 42(2), 330\u2013348 (2017). https:\/\/doi.org\/10.1287\/moor.2016.0817","journal-title":"In: Mathematics of Operations Research"},{"key":"2762_CR7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-Order Methods in Optimization. SIAM (2017). https:\/\/doi.org\/10.1137\/1.9781611974997","journal-title":"First-Order Methods in Optimization. SIAM"},{"key":"2762_CR8","unstructured":"Bento, G.C., Mordukhovich, B.S., Mota, T.S., Nesterov, Yu.: \u201cConvergence of Descent Optimization Algorithms under Polyak-\u0141ojasiewicz-Kurdyka Conditions\u201d. In: Journal of Optimization Theory and Applications, to appear (2025)"},{"issue":"4","key":"2762_CR9","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1137\/S105262349733096","volume":"10","author":"EG Birgin","year":"2000","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Raydan, M.: Nonmonotone spectral projected gradient methods on convex sets. In: SIAM Journal on Optimization 10(4), 1196\u20131211 (2000). https:\/\/doi.org\/10.1137\/S105262349733096","journal-title":"In: SIAM Journal on Optimization"},{"issue":"4","key":"2762_CR10","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.: The \u0141ojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems. In: SIAM Journal on Optimization 17(4), 1205\u20131223 (2007). https:\/\/doi.org\/10.1137\/050644641","journal-title":"In: SIAM Journal on Optimization"},{"issue":"2","key":"2762_CR11","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1137\/060670080","volume":"18","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A., Shiota, M.: Clarke subgradients of stratifiable functions. SIAM J. Optim. 18(2), 556\u2013572 (2007). https:\/\/doi.org\/10.1137\/060670080","journal-title":"SIAM J. Optim."},{"key":"2762_CR12","doi-asserted-by":"publisher","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. 146, 459\u2013494 (2014). https:\/\/doi.org\/10.1007\/s10107-013-0701-9","journal-title":"Math. Program."},{"issue":"2","key":"2762_CR13","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/s10957-015-0730-z","volume":"171","author":"RI Bo\u0163","year":"2016","unstructured":"Bo\u0163, R.I., Csetnek, E.R.: An inertial Tseng\u2019s type proximal algorithm for nonsmooth and nonconvex optimization problems. In: Journal of Optimization Theory and Applications 171(2), 600\u2013616 (2016). https:\/\/doi.org\/10.1007\/s10957-015-0730-z","journal-title":"In: Journal of Optimization Theory and Applications"},{"issue":"1","key":"2762_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s13675-015-0045-8","volume":"4","author":"RI Bo\u0163","year":"2016","unstructured":"Bo\u0163, R.I., Csetnek, E.R., L\u00e1szl\u00f3, S.C.: An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions. In: EURO Journal on Computational Optimization 4(1), 3\u201325 (2016). https:\/\/doi.org\/10.1007\/s13675-015-0045-8","journal-title":"In: EURO Journal on Computational Optimization"},{"issue":"1","key":"2762_CR15","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1137\/060657704","volume":"51","author":"AM Bruckstein","year":"2009","unstructured":"Bruckstein, A.M., Donoho, D.L., Elad, M.: From sparse solutions of systems of equations to sparse modeling of signals and images. In: SIAM Review 51(1), 34\u201381 (2009). https:\/\/doi.org\/10.1137\/060657704","journal-title":"In: SIAM Review"},{"issue":"10","key":"2762_CR16","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1109\/LSP.2007.898300","volume":"14","author":"R Chartrand","year":"2007","unstructured":"Chartrand, R.: Exact reconstruction of sparse signals via nonconvex minimization. In: IEEE Signal Processing Letters 14(10), 707\u2013710 (2007). https:\/\/doi.org\/10.1109\/LSP.2007.898300","journal-title":"In: IEEE Signal Processing Letters"},{"key":"2762_CR17","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/s10957-021-01929-5","volume":"193","author":"E Cohen","year":"2022","unstructured":"Cohen, E., Hallak, N., Teboulle, M.: Dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints. J. Optim. Theory Appl. 193, 324\u2013353 (2022). https:\/\/doi.org\/10.1007\/s10957-021-01929-5","journal-title":"J. Optim. Theory Appl."},{"key":"2762_CR18","doi-asserted-by":"publisher","unstructured":"De Marchi. A.: \u201cProximal gradient methods beyond monotony\u201d. In: Journal of Nonsmooth Analysis and Optimization 4 (2023). https:\/\/doi.org\/10.46298\/jnsao-2023-10290","DOI":"10.46298\/jnsao-2023-10290"},{"issue":"1","key":"2762_CR19","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1007\/s10107-022-01922-4","volume":"201","author":"A De Marchi","year":"2023","unstructured":"De Marchi, A., Jia, X., Kanzow, C., Mehlitz, P.: Constrained composite optimization and augmented Lagrangian methods. In: Mathematical Programming 201(1), 863\u2013896 (2023). https:\/\/doi.org\/10.1007\/s10107-022-01922-4","journal-title":"In: Mathematical Programming"},{"issue":"6","key":"2762_CR20","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1080\/10556788.2011.577773","volume":"27","author":"D Di Lorenzo","year":"2012","unstructured":"Di Lorenzo, D., Liuzzi, G., Rinaldi, F., Schoen, F., Sciandrone, M.: A concave optimization-based approach for sparse portfolio selection. In: Optimization Methods and Software 27(6), 983\u20131000 (2012). https:\/\/doi.org\/10.1080\/10556788.2011.577773","journal-title":"In: Optimization Methods and Software"},{"key":"2762_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78674-2","author":"B Dumitrescu","year":"2018","unstructured":"Dumitrescu, B., Irofti, P.: Dictionary Learning Algorithms and Applications. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-78674-2","journal-title":"Dictionary Learning Algorithms and Applications. Springer"},{"issue":"4","key":"2762_CR22","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L Grippo","year":"1986","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A nonmonotone line search technique for Newton\u2019s method. In: SIAM Journal on Numerical Analysis 23(4), 707\u2013716 (1986). https:\/\/doi.org\/10.1137\/0723046","journal-title":"In: SIAM Journal on Numerical Analysis"},{"issue":"4","key":"2762_CR23","doi-asserted-by":"publisher","first-page":"3038","DOI":"10.1137\/23M1548293","volume":"33","author":"X Jia","year":"2023","unstructured":"Jia, X., Kanzow, C., Mehlitz, P.: Convergence analysis of the proximal gradient method in the presence of the Kurdyka-\u0141ojasiewicz property without global Lipschitz assumptions. In: SIAM Journal on Optimization 33(4), 3038\u20133056 (2023). https:\/\/doi.org\/10.1137\/23M1548293","journal-title":"In: SIAM Journal on Optimization"},{"issue":"1","key":"2762_CR24","doi-asserted-by":"publisher","first-page":"1365","DOI":"10.1007\/s10107-022-01870-z","volume":"199","author":"X Jia","year":"2023","unstructured":"Jia, X., Kanzow, C., Mehlitz, P., Wachsmuth, G.: An augmented Lagrangian method for optimization problems with structured geometric constraints. In: Mathematical Programming 199(1), 1365\u20131415 (2023). https:\/\/doi.org\/10.1007\/s10107-022-01870-z","journal-title":"In: Mathematical Programming"},{"issue":"2","key":"2762_CR25","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1007\/s10957-022-02101-3","volume":"195","author":"C Kanzow","year":"2022","unstructured":"Kanzow, C., Mehlitz, P.: Convergence properties of monotone and nonmonotone proximal gradient methods revisited. In: Journal of Optimization Theory and Applications 195(2), 624\u2013646 (2022). https:\/\/doi.org\/10.1007\/s10957-022-02101-3","journal-title":"In: Journal of Optimization Theory and Applications"},{"issue":"3","key":"2762_CR26","doi-asserted-by":"publisher","first-page":"769","DOI":"10.5802\/aif.1638","volume":"48","author":"K Kurdyka","year":"1998","unstructured":"Kurdyka, K.: On gradients of functions definable in o-minimal structures. In: Annales de l\u2019institut Fourier 48(3), 769\u2013783 (1998). https:\/\/doi.org\/10.5802\/aif.1638","journal-title":"In: Annales de l\u2019institut Fourier"},{"issue":"14","key":"2762_CR27","doi-asserted-by":"publisher","first-page":"3641","DOI":"10.1109\/TSP.2015.2428224","volume":"63","author":"Y-F Liu","year":"2015","unstructured":"Liu, Y.-F., Dai, Y.-H., Ma, S.: Joint power and admission control: non-convex $$\\ell _q$$ approximation and an effective polynomial time deflation approach. In:IEEE Transactions on Signal Processing 63(14), 3641\u20133656 (2015). https:\/\/doi.org\/10.1109\/TSP.2015.2428224","journal-title":"In:IEEE Transactions on Signal Processing"},{"issue":"11","key":"2762_CR28","doi-asserted-by":"publisher","first-page":"5714","DOI":"10.1109\/TSP.2012.2212015","volume":"60","author":"G Marjanovic","year":"2012","unstructured":"Marjanovic, G., Solo, V.: On $$\\ell _q$$ optimization and matrix completion. In: IEEE Transactions on Signal Processing 60(11), 5714\u20135724 (2012). https:\/\/doi.org\/10.1109\/TSP.2012.2212015","journal-title":"In: IEEE Transactions on Signal Processing"},{"key":"2762_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-2227-2","author":"I Markovsky","year":"2018","unstructured":"Markovsky, I.: Low Rank Approximation. Springer (2018). https:\/\/doi.org\/10.1007\/978-1-4471-2227-2","journal-title":"Low Rank Approximation. Springer"},{"key":"2762_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-92775-6","author":"BS Mordukhovich","year":"2018","unstructured":"Mordukhovich, B.S.: Variational Analysis and Applications. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-92775-6","journal-title":"Variational Analysis and Applications. Springer"},{"issue":"1","key":"2762_CR31","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s10957-018-1272-y","volume":"177","author":"P Ochs","year":"2018","unstructured":"Ochs, P.: Local convergence of the heavy-ball method and iPiano for non-convex optimization. J. Optim. Theory Appl. 177(1), 153\u2013180 (2018). https:\/\/doi.org\/10.1007\/s10957-018-1272-y","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"2762_CR32","doi-asserted-by":"publisher","first-page":"1388","DOI":"10.1137\/130942954","volume":"7","author":"P Ochs","year":"2014","unstructured":"Ochs, P., Chen, Y., Brox, T., Pock, T.: iPiano: Inertial proximal algorithm for nonconvex optimization. In: SIAM Journal on Imaging Sciences 7(2), 1388\u20131419 (2014). https:\/\/doi.org\/10.1137\/130942954","journal-title":"In: SIAM Journal on Imaging Sciences"},{"key":"2762_CR33","unstructured":"Qian, Y., Pan, S.: \u201cConvergence of a class of nonmonotone descent methods for KL optimization problems\u201d. In: arXiv preprint arXiv:2201.00639 (2022)"},{"issue":"2","key":"2762_CR34","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1137\/24M1669153","volume":"35","author":"Y Qian","year":"2025","unstructured":"Qian, Y., Tao, T., Pan, S., Qi, H.: Convergence of ZH-type nonmonotone descent method for Kurdyka-\u0141ojasiewicz optimization problems. In: SIAM Journal on Optimization 35(2), 1089\u20131109 (2025). https:\/\/doi.org\/10.1137\/24M1669153","journal-title":"In: SIAM Journal on Optimization"},{"key":"2762_CR35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-02431-3","journal-title":"Variational Analysis. Springer"},{"key":"2762_CR36","doi-asserted-by":"publisher","unstructured":"Ye, J.J., Yuan, X., Zeng, S., Zhang, J.: \u201cVariational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems\u201d. In: Set-Valued and Variational Analysis (2021), pp.\u00a01\u201335. https:\/\/doi.org\/10.1007\/s11228-021-00591-3","DOI":"10.1007\/s11228-021-00591-3"},{"key":"2762_CR37","doi-asserted-by":"publisher","unstructured":"Zhang, H., Hager, W.W.: \u201cA nonmonotone line search technique and its application to unconstrained optimization\u201d. In: SIAM Journal on Optimization 14(4) (2004), pp.\u00a01043\u20131056. https:\/\/doi.org\/10.1137\/S1052623403428208","DOI":"10.1137\/S1052623403428208"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02762-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-025-02762-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02762-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T09:36:02Z","timestamp":1753954562000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-025-02762-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,4]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["2762"],"URL":"https:\/\/doi.org\/10.1007\/s10957-025-02762-w","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2025,7,4]]},"assertion":[{"value":"23 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 July 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No conflict of interest has been reported by the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"4"}}