{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:45:45Z","timestamp":1772793945357,"version":"3.50.1"},"reference-count":63,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"publisher","award":["2023YFA1011400"],"award-info":[{"award-number":["2023YFA1011400"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12326605"],"award-info":[{"award-number":["12326605"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12222106"],"award-info":[{"award-number":["12222106"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12501429"],"award-info":[{"award-number":["12501429"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100017607","name":"Shenzhen Fundamental Research Program","doi-asserted-by":"publisher","award":["20250530150024003"],"award-info":[{"award-number":["20250530150024003"]}],"id":[{"id":"10.13039\/501100017607","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[2026,3,31]]},"DOI":"10.1137\/24m1721049","type":"journal-article","created":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T08:36:43Z","timestamp":1772786203000},"page":"350-380","source":"Crossref","is-referenced-by-count":0,"title":["Alternating Gradient-Type Algorithm for Bilevel Optimization with Inexact Lower-Level Solutions via Moreau Envelope\u2013Based Reformulation"],"prefix":"10.1137","volume":"36","author":[{"given":"Xiaoning","family":"Bai","sequence":"first","affiliation":[{"name":"Department of Mathematics, Southern University of Science and Technology, Shenzhen 518055, People\u2019s Republic of China."}]},{"given":"Shangzhi","family":"Zeng","sequence":"additional","affiliation":[{"name":"National Center for Applied Mathematics Shenzhen and Department of Mathematics, Southern University of Science and Technology, Shenzhen 518055, People\u2019s Republic of China."}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6691-5612","authenticated-orcid":true,"given":"Jin","family":"Zhang","sequence":"additional","affiliation":[{"name":"Corresponding author. Department of Mathematics and National Center for Applied Mathematics Shenzhen, Southern University of Science and Technology, Shenzhen 518055, People\u2019s Republic of China."}]},{"given":"Lezhi","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, City University of Hong Kong, Hong Kong SAR, People\u2019s Republic of China, and Department of Mathematics, Southern University of Science and Technology, Shenzhen 518055, People\u2019s Republic of China."}]}],"member":"351","published-online":{"date-parts":[[2026,3,6]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-024-02113-z"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0535-x"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1100.0449"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0484-9"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2024.2358086"},{"key":"ref6","unstructured":"X. Bai, S. Zeng, J. Zhang, and L. Zhang, Alternating Gradient-Type Algorithm for Bilevel Optimization with Inexact Lower-Level Solutions via Moreau Envelope-Based Reformulation, preprint, arXiv:2412.18929, 2025."},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2836-1"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68860-0_2"},{"key":"ref10","unstructured":"J. Bergstra, D. Yamins, and D. Cox, Making a science of model search: Hyperparameter optimization in hundreds of dimensions for vision architectures, in International Conference on Machine Learning, 2013, pp. 115\u2013123."},{"key":"ref11","unstructured":"Q. Bertrand, Q. Klopfenstein, M. Blondel, S. Vaiter, A. Gramfort, and J. Salmon, Implicit differentiation of Lasso-type models for hyperparameter optimization, in International Conference on Machine Learning, 2020, pp. 810\u2013821."},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/050644641"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/060670080"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-09-05048-X"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0701-9"},{"key":"ref16","volume-title":"Perturbation Analysis of Optimization Problems","author":"Bonnans J. F.","year":"2013"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.04.014"},{"key":"ref18","first-page":"25294","volume-title":"Advances in Neural Information Processing Systems","author":"Chen T.","year":"2021"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-007-0176-2"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.1995.tb00011.x"},{"key":"ref21","volume-title":"Foundations of Bilevel Programming","author":"Dempe S.","year":"2002"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-52119-6"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0508-5"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2017.0889"},{"key":"ref25","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"Facchinei F.","year":"2007"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2017.1390470"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2021.1977810"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-020-00254-3"},{"key":"ref29","unstructured":"L. Franceschi, P. Frasconi, S. Salzo, R. Grazzi, and M. Pontil, Bilevel programming for hyperparameter optimization and meta-learning, in International Conference on Machine Learning, 2018, 1568\u20131577."},{"key":"ref30","unstructured":"L. L. Gao, J. J. Ye, H. Yin, S. Zeng, and J. Zhang, Value function based difference-of-convex algorithm for bilevel hyperparameter selection problems, in International Conference on Machine Learning, 2022, pp. 7164\u20137182."},{"key":"ref31","unstructured":"L. L. Gao, J. J. Ye, H. Yin, S. Zeng, and J. Zhang, Moreau Envelope Based Difference-of-Weakly-Convex Reformulation and Algorithm for Bilevel Programs, preprint, arXiv:2306.16761, 2024."},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1086\/261967"},{"key":"ref33","unstructured":"R. Grazzi, L. Franceschi, M. Pontil, and S. Salzo, On the iteration complexity of hypergradient computation, in International Conference on Machine Learning, 2020, pp. 3748\u20133758."},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/20M1387341"},{"key":"ref35","unstructured":"K. Ji, J. Yang, and Y. Liang, Bilevel optimization: Convergence analysis and enhanced design, in International Conference on Machine Learning, 2021, pp. 4882\u20134892."},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2024.2313688"},{"key":"ref37","doi-asserted-by":"crossref","unstructured":"H. Karimi, J. Nutini, and M. Schmidt, Linear convergence of gradient and proximal-gradient methods under the Polyak-\u0141ojasiewicz condition, in Joint European Conference on Machine Learning and Knowledge Discovery in Databases, Springer-Verlag, Berlin, 2016, pp. 795\u2013811.","DOI":"10.1007\/978-3-319-46128-1_50"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1080\/10556780802102586"},{"key":"ref39","unstructured":"J. Kwon, D. Kwon, S. Wright, and R. D. Nowak, A fully first-order method for stochastic bilevel optimization, in International Conference on Machine Learning, 2023, pp. 18083\u201318113."},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.52202\/068431-1254"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3132674"},{"key":"ref42","unstructured":"R. Liu, Z. Liu, W. Yao, S. Zeng, and J. Zhang, Moreau envelope for nonconvex bi-level optimization: A single-loop and Hessian-free solution strategy, in International Conference on Machine Learning, 2024, pp. 31566\u201331596."},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.52202\/075280-3526"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/23M1566753"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511983658"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/BF01099649"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1111\/1467-937X.00075"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01797-5"},{"key":"ref49","first-page":"155","volume":"1","author":"Ngai H. V.","year":"2000","journal-title":"J. Nonlinear Convex Anal."},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/BF01068677"},{"key":"ref51","first-page":"1","volume":"22","author":"Okuno T.","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"ref52","first-page":"255","volume":"34","author":"Outrata J.","year":"1990","journal-title":"Z. Oper. Res."},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2825-5"},{"key":"ref54","unstructured":"H. Shen and T. Chen, On penalty-based bilevel gradient descent method, in International Conference on Machine Learning, 2023, pp. 30992\u201331015."},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2012.681250"},{"key":"ref56","volume-title":"Market Structure and Equilibrium","author":"Von Stackelberg H.","year":"2010"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0559-y"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-023-02219-y"},{"key":"ref59","unstructured":"W. Yao, H. Yin, S. Zeng, and J. Zhang, Overcoming lower-level constraints in bilevel optimization: A novel approach with regularized gap functions, in International Conference on Learning Representations, 2025, https:\/\/openreview.net\/forum?id=cyPMEXdqQ2."},{"key":"ref60","unstructured":"W. Yao, C. Yu, S. Zeng, and J. Zhang, Constrained bi-level optimization: Proximal Lagrangian value function approach and Hessian-free algorithm, in International Conference on Learning Representations, 2024, https:\/\/openreview.net\/forum?id=xJ5N8qrEPl."},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01888-3"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1080\/02331939508844060"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2024.3358284"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T08:36:49Z","timestamp":1772786209000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/24M1721049"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,6]]},"references-count":63,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3,31]]}},"alternative-id":["10.1137\/24M1721049"],"URL":"https:\/\/doi.org\/10.1137\/24m1721049","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,6]]}}}