{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:31:53Z","timestamp":1783578713168,"version":"3.55.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T00:00:00Z","timestamp":1738281600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T00:00:00Z","timestamp":1738281600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100010027","name":"University of Greenwich","doi-asserted-by":"crossref","award":["R1110"],"award-info":[{"award-number":["R1110"]}],"id":[{"id":"10.13039\/100010027","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100018693","name":"HORIZON EUROPE Framework Programme","doi-asserted-by":"publisher","award":["101192383"],"award-info":[{"award-number":["101192383"]}],"id":[{"id":"10.13039\/100018693","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10957-024-02564-6","type":"journal-article","created":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T07:28:35Z","timestamp":1738308515000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the Convergence of Proximal Gradient Methods for Convex Simple Bilevel Optimization"],"prefix":"10.1007","volume":"204","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7969-8565","authenticated-orcid":false,"given":"Puya","family":"Latafat","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andreas","family":"Themelis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Silvia","family":"Villa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Panagiotis","family":"Patrinos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,1,31]]},"reference":[{"issue":"3","key":"2564_CR1","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1137\/S1052623493259616","volume":"6","author":"H Attouch","year":"1996","unstructured":"Attouch, H.: Viscosity solutions of minimization problems. SIAM Journal on Optimization 6(3), 769\u2013806 (1996)","journal-title":"SIAM Journal on Optimization"},{"key":"2564_CR2","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF01027092","volume":"2","author":"MA Bahraoui","year":"1994","unstructured":"Bahraoui, M.A., Lemaire, B.: Convergence of diagonally stationary sequences in convex optimization. Set-Valued Analysis 2, 49\u201361 (1994)","journal-title":"Set-Valued Analysis"},{"issue":"1","key":"2564_CR3","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.M.: Two-point step size gradient methods. IMA Journal of Numerical Analysis 8(1), 141\u2013148 (1988)","journal-title":"IMA Journal of Numerical Analysis"},{"key":"2564_CR4","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. CMS Books in Mathematics, Springer (2017)"},{"key":"2564_CR5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First-Order Methods in Optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-Order Methods in Optimization. SIAM, Philadelphia, PA (2017)"},{"issue":"1\u20132","key":"2564_CR6","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-013-0708-2","volume":"147","author":"A Beck","year":"2014","unstructured":"Beck, A., Sabach, S.: A first order method for finding minimal norm-like solutions of convex optimization problems. Mathematical Programming 147(1\u20132), 25\u201346 (2014)","journal-title":"Mathematical Programming"},{"issue":"8","key":"2564_CR7","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1080\/02331934.2021.1939336","volume":"71","author":"G Bigi","year":"2022","unstructured":"Bigi, G., Lampariello, L., Sagratella, S.: Combining approximation and exact penalty in hierarchical programming. Optimization 71(8), 2403\u20132419 (2022)","journal-title":"Optimization"},{"key":"2564_CR8","first-page":"14879","volume":"33","author":"Z Borsos","year":"2020","unstructured":"Borsos, Z., Mutny, M., Krause, A.: Coresets via bilevel optimization for continual learning and streaming. Advances in Neural Information Processing Systems 33, 14879\u201314890 (2020)","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"2","key":"2564_CR9","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1137\/S105262340343467X","volume":"15","author":"A Cabot","year":"2005","unstructured":"Cabot, A.: Proximal point algorithm controlled by a slowly vanishing term: applications to hierarchical minimization. SIAM Journal on Optimization 15(2), 555\u2013572 (2005)","journal-title":"SIAM Journal on Optimization"},{"key":"2564_CR10","unstructured":"Cao, J., Jiang, R., Hamedani, E.Y., Mokhtari, A.: An accelerated gradient method for simple bilevel optimization with convex lower-level problem (2024). arXiv:2402.08097"},{"key":"2564_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1961189.1961199","volume":"2","author":"CC Chang","year":"2011","unstructured":"Chang, C.C., Lin, C.J.: LIBSVM: A library for support vector machines. ACM Transactions on Intelligent Systems and Technology (TIST) 2, 1\u201327 (2011)","journal-title":"ACM Transactions on Intelligent Systems and Technology (TIST)"},{"key":"2564_CR12","unstructured":"Dempe, S.: Foundations of Bilevel Programming. Springer Science & Business Media (2002)"},{"key":"2564_CR13","doi-asserted-by":"crossref","unstructured":"Dempe, S.: Bilevel optimization: theory, algorithms, applications and a bibliography. Bilevel Optimization: Advances and Next Challenges pp. 581\u2013672 (2020)","DOI":"10.1007\/978-3-030-52119-6_20"},{"key":"2564_CR14","doi-asserted-by":"crossref","unstructured":"Doron, L., Shtern, S.: Methodology and first-order algorithms for solving nonsmooth and non-strongly convex bilevel optimization problems. Math. Program. 201(1), 521\u2013528 (2023)","DOI":"10.1007\/s10107-022-01914-4"},{"issue":"1\u20132","key":"2564_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10107-013-0640-5","volume":"145","author":"F Facchinei","year":"2014","unstructured":"Facchinei, F., Pang, J.S., Scutari, G., Lampariello, L.: VI-constrained hemivariational inequalities: distributed algorithms and power control in ad-hoc networks. Mathematical Programming 145(1\u20132), 59\u201396 (2014)","journal-title":"Mathematical Programming"},{"key":"2564_CR16","unstructured":"Franceschi, L., Frasconi, P., Salzo, S., Grazzi, R., Pontil, M.: Bilevel programming for hyperparameter optimization and meta-learning. In: J.\u00a0Dy, A.\u00a0Krause (eds.) Proceedings of the 35th International Conference on Machine Learning, Proceedings of Machine Learning Research, vol.\u00a080, pp. 1568\u20131577. PMLR (2018)"},{"key":"2564_CR17","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10851-017-0754-0","volume":"60","author":"G Garrigos","year":"2018","unstructured":"Garrigos, G., Rosasco, L., Villa, S.: Iterative regularization via dual diagonal descent. Journal of Mathematical Imaging and Vision 60, 189\u2013215 (2018)","journal-title":"Journal of Mathematical Imaging and Vision"},{"issue":"167","key":"2564_CR18","first-page":"1","volume":"24","author":"R Grazzi","year":"2023","unstructured":"Grazzi, R., Pontil, M., Salzo, S.: Bilevel optimization with a lower-level contraction: Optimal sample complexity without warm-start. Journal of Machine Learning Research 24(167), 1\u201337 (2023)","journal-title":"Journal of Machine Learning Research"},{"key":"2564_CR19","doi-asserted-by":"crossref","unstructured":"Guan, W., Song, W.: A first-order method for solving bilevel convex optimization problems in Banach space. Optimization 73(7), 2221\u20132246 (2024)","DOI":"10.1080\/02331934.2023.2192232"},{"issue":"5","key":"2564_CR20","doi-asserted-by":"publisher","first-page":"055020","DOI":"10.1088\/1361-6420\/aa6136","volume":"33","author":"ES Helou","year":"2017","unstructured":"Helou, E.S., Sim\u00f5es, L.E.: $$\\epsilon $$-subgradient algorithms for bilevel convex optimization. Inverse Problems 33(5), 055020 (2017)","journal-title":"Inverse Problems"},{"issue":"1","key":"2564_CR21","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1137\/20M1387341","volume":"33","author":"M Hong","year":"2023","unstructured":"Hong, M., Wai, H.T., Wang, Z., Yang, Z.: A two-timescale stochastic algorithm framework for bilevel optimization: Complexity analysis and application to actor-critic. SIAM Journal on Optimization 33(1), 147\u2013180 (2023)","journal-title":"SIAM Journal on Optimization"},{"key":"2564_CR22","unstructured":"Jiang, R., Abolfazli, N., Mokhtari, A., Hamedani, E.Y.: A conditional gradient-based method for simple bilevel optimization with convex lower-level problem. In: F.\u00a0Ruiz, J.\u00a0Dy, J.W. van\u00a0de Meent (eds.) International Conference on Artificial Intelligence and Statistics, pp. 10305\u201310323. PMLR (2023)"},{"issue":"3","key":"2564_CR23","doi-asserted-by":"publisher","first-page":"2171","DOI":"10.1137\/20M1357378","volume":"31","author":"HD Kaushik","year":"2021","unstructured":"Kaushik, H.D., Yousefian, F.: A method with convergence rates for optimization problems with variational inequality constraints. SIAM Journal on Optimization 31(3), 2171\u20132198 (2021)","journal-title":"SIAM Journal on Optimization"},{"issue":"3","key":"2564_CR24","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s00186-022-00799-5","volume":"96","author":"L Lampariello","year":"2022","unstructured":"Lampariello, L., Priori, G., Sagratella, S.: On the solution of monotone nested variational inequalities. Mathematical Methods of Operations Research 96(3), 421\u2013446 (2022)","journal-title":"Mathematical Methods of Operations Research"},{"key":"2564_CR25","unstructured":"Latafat, P., Themelis, A., Patrinos, P.: On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms. In: A.\u00a0Abate, M.\u00a0Cannon, K.\u00a0Margellos, A.\u00a0Papachristodoulou (eds.) Proceedings of the 6th Annual Learning for Dynamics & Control Conference, Proceedings of Machine Learning Research, vol. 242, pp. 197\u2013208. PMLR (2024)"},{"key":"2564_CR26","doi-asserted-by":"crossref","unstructured":"Latafat, P., Themelis, A., Stella, L., Patrinos, P.: Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient. Math. Program. (2024)","DOI":"10.1007\/s10107-024-02143-7"},{"key":"2564_CR27","unstructured":"Malitsky, Y., Mishchenko, K.: Adaptive gradient descent without descent. In: H.\u00a0Daum\u00e9, A.\u00a0Singh (eds.) Proceedings of the 37th International Conference on Machine Learning, vol. 119, pp. 6702\u20136712. PMLR (2020)"},{"issue":"4","key":"2564_CR28","doi-asserted-by":"publisher","first-page":"3114","DOI":"10.1137\/22M1533608","volume":"33","author":"R Merchav","year":"2023","unstructured":"Merchav, R., Sabach, S.: Convex bi-level optimization problems with non-smooth outer objective function. SIAM Journal on Optimization 33(4), 3114\u20133142 (2023)","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"2564_CR29","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1006\/jmaa.1999.6615","volume":"241","author":"A Moudafi","year":"2000","unstructured":"Moudafi, A.: Viscosity approximation methods for fixed-points problems. Journal of mathematical analysis and applications 241(1), 46\u201355 (2000)","journal-title":"Journal of mathematical analysis and applications"},{"issue":"1","key":"2564_CR30","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Mathematical Programming 140(1), 125\u2013161 (2013)","journal-title":"Mathematical Programming"},{"key":"2564_CR31","unstructured":"Oikonomidis, K., Laude, E., Latafat, P., Themelis, A., Patrinos, P.: Adaptive proximal gradient methods are universal without approximation. In: R.\u00a0Salakhutdinov, Z.\u00a0Kolter, K.\u00a0Heller, A.\u00a0Weller, N.\u00a0Oliver, J.\u00a0Scarlett, F.\u00a0Berkenkamp (eds.) Proceedings of the 41st International Conference on Machine Learning, vol. 235, pp. 38663\u201338682. PMLR (2024)"},{"key":"2564_CR32","unstructured":"Pedregosa, F.: Hyperparameter optimization with approximate gradient. In: M.F. Balcan, K.Q. Weinberger (eds.) Proceedings of The 33rd International Conference on Machine Learning, vol.\u00a048, pp. 737\u2013746. PMLR, New York, New York, USA (2016)"},{"key":"2564_CR33","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10957-011-9936-x","volume":"153","author":"J Peypouquet","year":"2012","unstructured":"Peypouquet, J.: Coupling the gradient method with a general exterior penalization scheme for convex minimization. Journal of Optimization Theory and Applications 153, 123\u2013138 (2012)","journal-title":"Journal of Optimization Theory and Applications"},{"key":"2564_CR34","unstructured":"Rajeswaran, A., Finn, C., Kakade, S.M., Levine, S.: Meta-learning with implicit gradients. Advances in neural information processing systems 32 (2019)"},{"key":"2564_CR35","unstructured":"Rockafellar, R.T., Wets, R.J.: Variational Analysis, vol. 317. Springer (2011)"},{"issue":"2","key":"2564_CR36","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1137\/16M105592X","volume":"27","author":"S Sabach","year":"2017","unstructured":"Sabach, S., Shtern, S.: A first order method for solving convex bilevel optimization problems. SIAM Journal on Optimization 27(2), 640\u2013660 (2017)","journal-title":"SIAM Journal on Optimization"},{"key":"2564_CR37","unstructured":"Samadi, S., Yousefian, F.: Improved guarantees for optimal nash equilibrium seeking and bilevel variational inequalities (2023). arXiv:2307.12511"},{"issue":"1","key":"2564_CR38","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1137\/050647566","volume":"18","author":"MV Solodov","year":"2007","unstructured":"Solodov, M.V.: A bundle method for a class of bilevel nonsmooth convex minimization problems. SIAM Journal on Optimization 18(1), 242\u2013259 (2007)","journal-title":"SIAM Journal on Optimization"},{"issue":"2","key":"2564_CR39","first-page":"227","volume":"14","author":"MV Solodov","year":"2007","unstructured":"Solodov, M.V.: An explicit descent method for bilevel convex optimization. Journal of Convex Analysis 14(2), 227 (2007)","journal-title":"Journal of Convex Analysis"},{"key":"2564_CR40","doi-asserted-by":"crossref","unstructured":"Themelis, A., Ahookhosh, M., Patrinos, P.: On the acceleration of forward-backward splitting via an inexact newton method. In: H.H. Bauschke, R.S. Burachik, D.R. Luke (eds.) Splitting Algorithms, Modern Operator Theory, and Applications, pp. 363\u2013412. Springer International Publishing (2019)","DOI":"10.1007\/978-3-030-25939-6_15"},{"issue":"1","key":"2564_CR41","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.jmaa.2004.04.059","volume":"298","author":"HK Xu","year":"2004","unstructured":"Xu, H.K.: Viscosity approximation methods for nonexpansive mappings. Journal of Mathematical Analysis and Applications 298(1), 279\u2013291 (2004)","journal-title":"Journal of Mathematical Analysis and Applications"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02564-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-024-02564-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02564-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T07:27:38Z","timestamp":1741073258000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-024-02564-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,31]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["2564"],"URL":"https:\/\/doi.org\/10.1007\/s10957-024-02564-6","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,31]]},"assertion":[{"value":"5 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"51"}}