{"id":"https://openalex.org/W7123336654","doi":"https://doi.org/10.1109/cdc57313.2025.11312232","title":"A Barrier-Based First-Order Method for Constrained Bilevel Optimization","display_name":"A Barrier-Based First-Order Method for Constrained Bilevel Optimization","publication_year":2025,"publication_date":"2025-12-09","ids":{"openalex":"https://openalex.org/W7123336654","doi":"https://doi.org/10.1109/cdc57313.2025.11312232"},"language":null,"primary_location":{"id":"doi:10.1109/cdc57313.2025.11312232","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc57313.2025.11312232","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 64th Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5122909617","display_name":"Cheng Ge","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cheng Ge","raw_affiliation_strings":["Massachusetts Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042979350","display_name":"Swati Padmanabhan","orcid":"https://orcid.org/0000-0002-4834-2136"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Swati Padmanabhan","raw_affiliation_strings":["Massachusetts Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078288116","display_name":"Ali Jadbabaie","orcid":"https://orcid.org/0000-0003-1122-3069"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ali Jadbabaie","raw_affiliation_strings":["Massachusetts Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.60833862,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"597","last_page":"604"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.7939000129699707,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.7939000129699707,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.04839999973773956,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.03539999946951866,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bilevel-optimization","display_name":"Bilevel optimization","score":0.7962999939918518},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.602400004863739},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5577999949455261},{"id":"https://openalex.org/keywords/dependency","display_name":"Dependency (UML)","score":0.5175999999046326},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.4415999948978424},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.4262000024318695},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.3946000039577484}],"concepts":[{"id":"https://openalex.org/C3309286","wikidata":"https://www.wikidata.org/wiki/Q4907693","display_name":"Bilevel optimization","level":3,"score":0.7962999939918518},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7172999978065491},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.602400004863739},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5842999815940857},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5577999949455261},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.5175999999046326},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.4415999948978424},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.4262000024318695},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3946000039577484},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.39309999346733093},{"id":"https://openalex.org/C2989514635","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization problem","level":3,"score":0.3790000081062317},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.33250001072883606},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3156000077724457},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3000999987125397},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.26579999923706055},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2531000077724457}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cdc57313.2025.11312232","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc57313.2025.11312232","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 64th Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/169037","is_oa":false,"landing_page_url":"https://dspace.mit.edu/handle/1721.1/169037","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Thesis"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Bilevel":[0],"optimization":[1],"(BLO)":[2],"problems":[3,88],"find":[4],"wide-ranging":[5],"applications":[6],"in":[7,22,103],"network":[8],"optimization,":[9],"transportation,":[10],"game":[11],"theory,":[12],"and":[13],"machine":[14],"learning.":[15],"Recently,":[16],"there":[17],"has":[18],"been":[19],"significant":[20],"interest":[21],"developing":[23],"efficient":[24],"gradient-based":[25,50],"algorithms":[26],"for":[27,48,84],"solving":[28],"BLO":[29,62,87],"problems,":[30,63],"with":[31,89],"a":[32,72,81,90,114],"particular":[33],"focus":[34],"on":[35,59,107,117],"first-order":[36,49,82],"methods":[37],"due":[38],"to":[39,94],"their":[40],"scalability.":[41],"However,":[42],"lower-level":[43],"(LL)":[44],"constraints":[45],"introduce":[46],"challenges":[47],"methods.":[51],"To":[52],"address":[53],"these":[54],"challenges,":[55],"this":[56],"paper":[57],"focuses":[58],"barrier-reformulated":[60,85],"constrained":[61,86],"where":[64],"the":[65,76,111,122,125,129],"LL":[66],"problem":[67],"is":[68,101],"transformed":[69],"by":[70],"incorporating":[71],"log":[73],"barrier":[74],"into":[75],"objective":[77],"function.":[78],"We":[79,119],"propose":[80],"method":[83,127],"non-asymptotic":[91],"convergence":[92,99],"guarantee":[93],"an":[95],"\u03f5-stationary":[96],"point.":[97],"The":[98],"rate":[100],"near-optimal":[102],"terms":[104],"of":[105,113,124],"dependency":[106],"\u03f5,":[108],"though":[109],"at":[110],"cost":[112],"linear":[115,130],"dependence":[116],"dimension.":[118],"also":[120],"demonstrate":[121],"effectiveness":[123],"proposed":[126],"through":[128],"price-setting":[131],"experiment.":[132]},"counts_by_year":[],"updated_date":"2026-08-12T21:12:35.861297","created_date":"2026-01-14T00:00:00"}