{"id":"https://openalex.org/W4396581060","doi":"https://doi.org/10.1137/22m1526204","title":"Exact Augmented Lagrangian Duality for Mixed Integer Convex Optimization","display_name":"Exact Augmented Lagrangian Duality for Mixed Integer Convex Optimization","publication_year":2024,"publication_date":"2024-05-02","ids":{"openalex":"https://openalex.org/W4396581060","doi":"https://doi.org/10.1137/22m1526204"},"language":"en","primary_location":{"id":"doi:10.1137/22m1526204","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1137/22m1526204","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-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/A5063861809","display_name":"Avinash Bhardwaj","orcid":"https://orcid.org/0000-0002-9690-1705"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Avinash Bhardwaj","raw_affiliation_strings":["Industrial Engineering and Operations Research, Indian Institute of Technology Bombay, Mumbai, 400076, India"],"raw_orcid":"https://orcid.org/0000-0002-9690-1705","affiliations":[{"raw_affiliation_string":"Industrial Engineering and Operations Research, Indian Institute of Technology Bombay, Mumbai, 400076, India","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084488825","display_name":"Vishnu Narayanan","orcid":null},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Vishnu Narayanan","raw_affiliation_strings":["Industrial Engineering and Operations Research, Indian Institute of Technology Bombay, Mumbai, 400076, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Industrial Engineering and Operations Research, Indian Institute of Technology Bombay, Mumbai, 400076, India","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004044094","display_name":"Abhishek Pathapati","orcid":null},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Abhishek Pathapati","raw_affiliation_strings":["Industrial Engineering and Operations Research, Indian Institute of Technology Bombay, Mumbai, 400076, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Industrial Engineering and Operations Research, Indian Institute of Technology Bombay, Mumbai, 400076, India","institution_ids":["https://openalex.org/I162827531"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07408334,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"34","issue":"2","first_page":"1622","last_page":"1645"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9997000098228455,"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.9988999962806702,"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"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9955000281333923,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8186686038970947},{"id":"https://openalex.org/keywords/augmented-lagrangian-method","display_name":"Augmented Lagrangian method","score":0.7216343879699707},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.6057020425796509},{"id":"https://openalex.org/keywords/lagrangian","display_name":"Lagrangian","score":0.5609731078147888},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5572935938835144},{"id":"https://openalex.org/keywords/strong-duality","display_name":"Strong duality","score":0.5360541343688965},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.506105363368988},{"id":"https://openalex.org/keywords/conic-optimization","display_name":"Conic optimization","score":0.5041462182998657},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4939177632331848},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4902389645576477},{"id":"https://openalex.org/keywords/duality-gap","display_name":"Duality gap","score":0.48318710923194885},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.48180216550827026},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.46903643012046814},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43412625789642334},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.35547420382499695},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.34457290172576904},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.332132488489151},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10849606990814209},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08130785822868347}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8186686038970947},{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.7216343879699707},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.6057020425796509},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.5609731078147888},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5572935938835144},{"id":"https://openalex.org/C163863214","wikidata":"https://www.wikidata.org/wiki/Q7624553","display_name":"Strong duality","level":3,"score":0.5360541343688965},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.506105363368988},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.5041462182998657},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4939177632331848},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4902389645576477},{"id":"https://openalex.org/C5274546","wikidata":"https://www.wikidata.org/wiki/Q5310264","display_name":"Duality gap","level":3,"score":0.48318710923194885},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.48180216550827026},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.46903643012046814},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43412625789642334},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.35547420382499695},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.34457290172576904},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.332132488489151},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10849606990814209},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08130785822868347},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/22m1526204","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1137/22m1526204","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1583497301","https://openalex.org/W1974522165","https://openalex.org/W1979562775","https://openalex.org/W2006751492","https://openalex.org/W2036833017","https://openalex.org/W2075451161","https://openalex.org/W2084572427","https://openalex.org/W2328414464","https://openalex.org/W2336243738","https://openalex.org/W3010376936","https://openalex.org/W3197711873","https://openalex.org/W4210397891","https://openalex.org/W4212979783","https://openalex.org/W4250589301","https://openalex.org/W4292363360","https://openalex.org/W4301808069"],"related_works":["https://openalex.org/W2155425983","https://openalex.org/W1985053614","https://openalex.org/W2172478086","https://openalex.org/W2017727320","https://openalex.org/W1801441248","https://openalex.org/W2152970697","https://openalex.org/W4307261727","https://openalex.org/W3048074522","https://openalex.org/W2085364069","https://openalex.org/W3125150697"],"abstract_inverted_index":{".Augmented":[0],"Lagrangian":[1,6,147],"dual":[2,7],"augments":[3],"the":[4,15,18,25,30,76,82,131,137],"classical":[5],"with":[8,134],"a":[9,55],"nonnegative":[10],"nonlinear":[11],"penalty":[12,42,51,65,139,149],"function":[13],"of":[14,17,63,136],"violation":[16],"relaxed/dualized":[19],"constraints":[20],"in":[21,32,141],"order":[22],"to":[23],"reduce":[24],"duality":[26],"gap.":[27],"We":[28,53],"investigate":[29],"cases":[31],"which":[33],"mixed":[34,68,86,105],"integer":[35,69,87,106,144],"convex":[36,70,145],"optimization":[37],"problems":[38],"have":[39],"an":[40,127],"exact":[41,64],"representation":[43],"using":[44,75],"sharp":[45],"augmenting":[46,50],"functions":[47],"(norms":[48],"as":[49],"functions).":[52],"present":[54],"generalizable":[56],"constructive":[57],"proof":[58,129],"technique":[59],"for":[60,67,85,130],"proving":[61],"existence":[62],"representations":[66],"programs":[71],"under":[72],"specific":[73],"conditions":[74],"associated":[77],"value":[78],"functions.":[79],"This":[80],"generalizes":[81],"recent":[83],"results":[84],"linear":[88],"programming":[89],"[M.":[90],"J.":[91,118],"Feizollahi,":[92],"S.":[93,111,114,115],"Ahmed,":[94,112],"and":[95,104,113],"A.":[96],"Sun,":[97],"Math.":[98],"Program.,":[99],"161":[100],"(2017),":[101],"pp.":[102,122],"365\u2013387]":[103],"quadratic":[107],"progamming":[108],"[X.":[109],"Gu,":[110],"Dey,":[116],"SIAM":[117],"Optim.,":[119],"30":[120],"(2020),":[121],"781\u2013797]":[123],"while":[124],"also":[125],"providing":[126],"alternative":[128],"aforementioned":[132],"along":[133],"quantification":[135],"finite":[138],"parameter":[140],"these":[142],"cases.Keywordsmixed":[143],"optimizationaugmented":[146],"dualityexact":[148],"representationMSC":[150],"codes90C1190C46":[151]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}