{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T14:24:49Z","timestamp":1768314289467,"version":"3.49.0"},"reference-count":42,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T00:00:00Z","timestamp":1765238400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T00:00:00Z","timestamp":1765238400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,12,9]]},"DOI":"10.1109\/cdc57313.2025.11312232","type":"proceedings-article","created":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T18:19:56Z","timestamp":1768241996000},"page":"597-604","source":"Crossref","is-referenced-by-count":0,"title":["A Barrier-Based First-Order Method for Constrained Bilevel Optimization"],"prefix":"10.1109","author":[{"given":"Cheng","family":"Ge","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Swati","family":"Padmanabhan","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Jadbabaie","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-007-0176-2"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3132674"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/s1052623493260696"},{"key":"ref4","first-page":"238","article-title":"Decentralized gossip-based stochastic bilevel optimization over communication networks","volume":"35","author":"Yang","year":"2022","journal-title":"Advances in neural information processing systems"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01099649"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-012-0213-0"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-52119-6_20"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijepes.2016.03.015"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijepes.2020.106455"},{"key":"ref10","article-title":"Meta-learning with implicit gradients","volume":"32","author":"Rajeswaran","year":"2019","journal-title":"Advances in neural information processing systems"},{"key":"ref11","article-title":"A gradient-based bilevel optimization approach for tuning hyperparameters in machine learning","author":"Sinha","year":"2020"},{"key":"ref12","article-title":"Adversarial training: A survey","author":"Zhao","year":"2024"},{"key":"ref13","article-title":"Approximation methods for bilevel programming","author":"Ghadimi","year":"2018"},{"key":"ref14","first-page":"30271","article-title":"A near-optimal algorithm for stochastic bilevel optimization via double-momentum","volume":"34","author":"Khanduri","year":"2021","journal-title":"Advances in neural information processing systems"},{"key":"ref15","first-page":"347","article-title":"Penalty method for inversion-free deep bilevel optimization","volume-title":"Asian conference on machine learning","author":"Mehra"},{"key":"ref16","first-page":"17248","article-title":"Bome! bilevel optimization made easy: A simple first-order approach","volume-title":"Advances in Neural Information Processing Systems","volume":"35","author":"Liu","year":"2022"},{"key":"ref17","first-page":"18083","article-title":"A fully first-order method for stochastic bilevel optimization","volume-title":"International Conference on Machine Learning","author":"Kwon"},{"key":"ref18","first-page":"16291","article-title":"Linearly constrained bilevel optimization: A smoothed implicit gradient approach","volume-title":"International Conference on Machine Learning","author":"Khanduri"},{"key":"ref19","article-title":"Barrier function for bilevel optimization with coupled lower-level constraints: Formulation, approximation and algorithms","author":"Jiang","year":"2024"},{"key":"ref20","first-page":"7164","article-title":"Value function based difference-of-convex algorithm for bilevel hyperparameter selection problems","volume-title":"Proceedings of the 39th International Conference on Machine Learning","volume":"162","author":"Gao"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TEMPR.2023.3344126"},{"key":"ref22","article-title":"On penalty methods for nonconvex bilevel optimization and first-order stochastic approximation","author":"Kwon","year":"2023"},{"key":"ref23","article-title":"Overcoming lower-level constraints in bilevel optimization: A novel approach with regularized gap functions","author":"Yao","year":"2024"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.52202\/079017-4491"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.52202\/079017-1068"},{"key":"ref26","article-title":"A primal-dual-assisted penalty approach to bilevel optimization with coupled constraints","author":"Jiang","year":"2024"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP49357.2023.10096878"},{"key":"ref28","article-title":"Spider: Near-optimal nonconvex optimization via stochastic path-integrated differential estimator","volume":"31","author":"Fang","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref29","article-title":"Momentum-based variance reduction in non-convex sgd","volume":"32","author":"Cutkosky","year":"2019","journal-title":"Advances in neural information processing systems"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01406-y"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01822-7"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/591"},{"key":"ref33","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-3557-3","volume-title":"Minimax and applications.","volume":"4","author":"Du","year":"1995"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-39568-1"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/20M1387341"},{"key":"ref36","article-title":"Spiderboost and momentum: Faster variance reduction algorithms","volume":"32","author":"Wang","year":"2019","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref37","first-page":"6286","article-title":"Page: A simple and optimal probabilistic gradient estimator for nonconvex optimization","volume-title":"International conference on machine learning","author":"Li"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2512329"},{"key":"ref39","article-title":"Accelerating stochastic gradient descent using predictive variance reduction","volume":"26","author":"Johnson","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1017\/9781009218276"},{"key":"ref41","first-page":"arXiv","article-title":"Constrained bi-level optimization: Proximal lagrangian value function approach and hessian-free algorithm","author":"Yao","year":"2024"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i10.26473"}],"event":{"name":"2025 IEEE 64th Conference on Decision and Control (CDC)","location":"Rio de Janeiro, Brazil","start":{"date-parts":[[2025,12,9]]},"end":{"date-parts":[[2025,12,12]]}},"container-title":["2025 IEEE 64th Conference on Decision and Control (CDC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11311984\/11311968\/11312232.pdf?arnumber=11312232","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T08:35:18Z","timestamp":1768293318000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11312232\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,9]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/cdc57313.2025.11312232","relation":{},"subject":[],"published":{"date-parts":[[2025,12,9]]}}}