{"id":"https://openalex.org/W4372269399","doi":"https://doi.org/10.1109/icassp49357.2023.10096878","title":"An Implicit Gradient Method for Constrained Bilevel Problems Using Barrier Approximation","display_name":"An Implicit Gradient Method for Constrained Bilevel Problems Using Barrier Approximation","publication_year":2023,"publication_date":"2023-05-05","ids":{"openalex":"https://openalex.org/W4372269399","doi":"https://doi.org/10.1109/icassp49357.2023.10096878"},"language":"en","primary_location":{"id":"doi:10.1109/icassp49357.2023.10096878","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/icassp49357.2023.10096878","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"},"type":"article","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/A5048310413","display_name":"Ioannis Tsaknakis","orcid":"https://orcid.org/0000-0002-1136-055X"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ioannis Tsaknakis","raw_affiliation_strings":["University of Minnesota,Department of Electrical and Computer Engineering,MN,USA","Department of Electrical and Computer Engineering, University of Minnesota, MN, USA"],"affiliations":[{"raw_affiliation_string":"University of Minnesota,Department of Electrical and Computer Engineering,MN,USA","institution_ids":["https://openalex.org/I130238516"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Minnesota, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015133769","display_name":"Prashant Khanduri","orcid":null},"institutions":[{"id":"https://openalex.org/I185443292","display_name":"Wayne State University","ror":"https://ror.org/01070mq45","country_code":"US","type":"education","lineage":["https://openalex.org/I185443292"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Prashant Khanduri","raw_affiliation_strings":["Wayne State University,Department of Computer Science,MI,USA","Department of Computer Science, Wayne State University, MI, USA"],"affiliations":[{"raw_affiliation_string":"Wayne State University,Department of Computer Science,MI,USA","institution_ids":["https://openalex.org/I185443292"]},{"raw_affiliation_string":"Department of Computer Science, Wayne State University, MI, USA","institution_ids":["https://openalex.org/I185443292"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044959992","display_name":"Mingyi Hong","orcid":null},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mingyi Hong","raw_affiliation_strings":["University of Minnesota,Department of Electrical and Computer Engineering,MN,USA","Department of Electrical and Computer Engineering, University of Minnesota, MN, USA"],"affiliations":[{"raw_affiliation_string":"University of Minnesota,Department of Electrical and Computer Engineering,MN,USA","institution_ids":["https://openalex.org/I130238516"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Minnesota, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5048310413"],"corresponding_institution_ids":["https://openalex.org/I130238516"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05682304,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11233","display_name":"Advanced Adaptive Filtering Techniques","score":0.9876999855041504,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9833999872207642,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6559905409812927},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6337392330169678},{"id":"https://openalex.org/keywords/stationary-point","display_name":"Stationary point","score":0.6232011318206787},{"id":"https://openalex.org/keywords/proximal-gradient-methods","display_name":"Proximal Gradient Methods","score":0.6086090207099915},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.5997331142425537},{"id":"https://openalex.org/keywords/bilevel-optimization","display_name":"Bilevel optimization","score":0.5916322469711304},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5420764684677124},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.530151903629303},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4935809373855591},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.48397135734558105},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.45896032452583313},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.42226195335388184},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4152825176715851},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.4036552309989929},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3659336566925049},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.17760473489761353},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1409805417060852}],"concepts":[{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6559905409812927},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6337392330169678},{"id":"https://openalex.org/C189237950","wikidata":"https://www.wikidata.org/wiki/Q2500758","display_name":"Stationary point","level":2,"score":0.6232011318206787},{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.6086090207099915},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.5997331142425537},{"id":"https://openalex.org/C3309286","wikidata":"https://www.wikidata.org/wiki/Q4907693","display_name":"Bilevel optimization","level":3,"score":0.5916322469711304},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5420764684677124},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.530151903629303},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4935809373855591},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.48397135734558105},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.45896032452583313},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.42226195335388184},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4152825176715851},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4036552309989929},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3659336566925049},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.17760473489761353},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1409805417060852},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp49357.2023.10096878","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/icassp49357.2023.10096878","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W56282943","https://openalex.org/W1564814491","https://openalex.org/W1945616565","https://openalex.org/W1975320652","https://openalex.org/W1996676734","https://openalex.org/W2013365934","https://openalex.org/W2030667419","https://openalex.org/W2048043258","https://openalex.org/W2050713766","https://openalex.org/W2119895058","https://openalex.org/W2505728881","https://openalex.org/W2602220366","https://openalex.org/W2787415863","https://openalex.org/W2972954809","https://openalex.org/W3041129870","https://openalex.org/W3044569448","https://openalex.org/W3082240632","https://openalex.org/W3123350987","https://openalex.org/W3162173877","https://openalex.org/W3170557719","https://openalex.org/W3207366668","https://openalex.org/W4225287848","https://openalex.org/W4225852813","https://openalex.org/W4226475730","https://openalex.org/W4250589301","https://openalex.org/W6640425456","https://openalex.org/W6725192724","https://openalex.org/W6735830628","https://openalex.org/W6748676082","https://openalex.org/W6767599400","https://openalex.org/W6780576306","https://openalex.org/W6781102248","https://openalex.org/W6795192965","https://openalex.org/W6796849125","https://openalex.org/W6802884475","https://openalex.org/W6810579990","https://openalex.org/W6811413059"],"related_works":["https://openalex.org/W2811217697","https://openalex.org/W4385644471","https://openalex.org/W4320495396","https://openalex.org/W4295266778","https://openalex.org/W2564172750","https://openalex.org/W2041341337","https://openalex.org/W2075334256","https://openalex.org/W2372778757","https://openalex.org/W2026452100","https://openalex.org/W4224903686"],"abstract_inverted_index":{"In":[0],"this":[1],"work,":[2],"we":[3,28,58,107],"propose":[4],"algorithms":[5],"for":[6],"solving":[7],"a":[8,30,43,65,70,109],"class":[9],"of":[10,79,99,111,117],"Bilevel":[11],"Optimization":[12],"(BLO)":[13],"problems,":[14],"with":[15,45],"applications":[16],"in":[17,50],"areas":[18],"such":[19],"as":[20],"signal":[21],"processing,":[22],"networking":[23],"and":[24,63,75],"machine":[25],"learning.":[26],"Specifically,":[27],"develop":[29,64],"novel":[31],"barrier-based":[32],"gradient":[33,62,72],"approximation":[34],"algorithm":[35],"that":[36,113],"transforms":[37],"the":[38,51,55,60,76,80,95,100,115,118],"constrained":[39,82],"BLO":[40],"problem":[41,44],"to":[42,103],"only":[46,69],"linear":[47],"equality":[48],"constraints":[49],"LL":[52,85],"task.":[53],"For":[54],"reformulated":[56],"problem,":[57],"compute":[59],"implicit":[61],"gradient-based":[66],"scheme,":[67],"involving":[68],"single":[71],"descent":[73],"step":[74],"(approximate)":[77],"solution":[78],"linearly":[81],"strongly":[83],"convex":[84],"task":[86],"at":[87],"each":[88],"iteration.":[89],"We":[90],"establish,":[91],"under":[92],"certain":[93],"assumptions,":[94],"non-asymptotic":[96],"convergence":[97],"guarantees":[98],"proposed":[101,119],"method":[102],"stationary":[104],"points.":[105],"Finally,":[106],"perform":[108],"number":[110],"experiments":[112],"show":[114],"potential":[116],"algorithm.":[120]},"counts_by_year":[],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}