{"id":"https://openalex.org/W7161019486","doi":"https://doi.org/10.48550/arxiv.2605.11694","title":"Augmented Lagrangian Method for Last-Iterate Convergence for Constrained MDPs","display_name":"Augmented Lagrangian Method for Last-Iterate Convergence for Constrained MDPs","publication_year":2026,"publication_date":"2026-05-12","ids":{"openalex":"https://openalex.org/W7161019486","doi":"https://doi.org/10.48550/arxiv.2605.11694"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.11694","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.11694","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.11694","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031262707","display_name":"Michael Lu","orcid":"https://orcid.org/0000-0003-4353-462X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lu, Michael","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5132678048","display_name":"Max Qiushi Lin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lin, Max Qiushi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136065608","display_name":"Mo Chen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Mo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5136055028","display_name":"Sharan Vaswani","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vaswani, Sharan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.8540999889373779,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.8540999889373779,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.031099999323487282,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","score":0.012400000356137753,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.7549999952316284},{"id":"https://openalex.org/keywords/augmented-lagrangian-method","display_name":"Augmented Lagrangian method","score":0.7425000071525574},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.5881999731063843},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5156999826431274},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.46219998598098755},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4244999885559082},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.41749998927116394}],"concepts":[{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.7549999952316284},{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.7425000071525574},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6880000233650208},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.671999990940094},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.5881999731063843},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5156999826431274},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.46219998598098755},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4244999885559082},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.41749998927116394},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.4004000127315521},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.36489999294281006},{"id":"https://openalex.org/C2989514635","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization problem","level":3,"score":0.3337000012397766},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3188000023365021},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.3077000081539154},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.30390000343322754},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.2718999981880188},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2653999924659729},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25519999861717224},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2549999952316284}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.11694","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.11694","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.11694","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.11694","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"score":0.7763881087303162,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,99,135],"study":[1],"policy":[2,25,41],"optimization":[3],"for":[4,18,97],"infinite-horizon,":[5],"discounted":[6],"constrained":[7,86],"Markov":[8],"decision":[9],"processes":[10],"(CMDPs).":[11],"While":[12],"existing":[13],"theoretical":[14,46,119],"guarantees":[15,120,158],"typically":[16],"hold":[17],"the":[19,60,78,103,110,118,124],"mixture":[20],"policy,":[21],"deploying":[22],"such":[23],"a":[24,34,38,90],"is":[26],"computationally":[27],"and":[28,88,106,123,143,173],"memory":[29],"intensive.":[30],"This":[31],"leads":[32],"to":[33,59,64,108,130,139,169],"practical":[35],"mismatch":[36],"where":[37],"single":[39],"(last-iterate)":[40],"must":[42],"be":[43],"deployed.":[44],"Recent":[45],"works":[47],"have":[48],"thus":[49],"focused":[50],"on":[51,102,176],"proving":[52],"last-iterate":[53,95,133,154],"convergence,":[54],"but":[55],"are":[56,68],"largely":[57],"limited":[58],"tabular":[61,104],"setting":[62,105],"or":[63],"algorithmic":[65],"variants":[66],"that":[67,145,165],"rarely":[69],"used":[70],"in":[71],"practice.":[72],"To":[73],"address":[74],"this,":[75],"we":[76,163],"use":[77],"classic":[79],"inexact":[80],"augmented":[81],"Lagrangian":[82],"($\\texttt{AL}$)":[83],"method":[84],"from":[85],"optimization,":[87],"propose":[89,107],"general":[91],"framework":[92,167],"with":[93,113,156],"provable":[94],"convergence":[96,155],"CMDPs.":[98],"first":[100],"focus":[101],"solve":[109],"$\\texttt{AL}$":[111,126],"sub-problem":[112],"projected":[114,148],"Q-ascent":[115],"($\\texttt{PQA}$).":[116],"Combining":[117],"of":[121,150],"$\\texttt{PQA}$":[122,151],"standard":[125],"analysis":[127],"enables":[128],"us":[129],"establish":[131],"global":[132],"convergence.":[134],"generalize":[136],"these":[137],"results":[138],"handle":[140],"log-linear":[141],"policies,":[142,172],"demonstrate":[144,164],"an":[146],"efficient,":[147],"variant":[149],"can":[152],"achieve":[153],"comparable":[157],"as":[159],"prior":[160],"work.":[161],"Finally,":[162],"our":[166],"scales":[168],"complex":[170],"non-linear":[171],"evaluate":[174],"it":[175],"continuous":[177],"control":[178],"tasks.":[179]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-14T00:00:00"}