{"id":"https://openalex.org/W7163205486","doi":"https://doi.org/10.48550/arxiv.2606.01487","title":"Global Convergence of a Line-Search Filter Differential Dynamic Programming Method","display_name":"Global Convergence of a Line-Search Filter Differential Dynamic Programming Method","publication_year":2026,"publication_date":"2026-05-31","ids":{"openalex":"https://openalex.org/W7163205486","doi":"https://doi.org/10.48550/arxiv.2606.01487"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.01487","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.01487","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":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.01487","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5137636066","display_name":"Ming Xu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xu, Ming","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5010259253","display_name":"Iman Shames","orcid":"https://orcid.org/0000-0001-7308-3546"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shames, Iman","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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/T12794","display_name":"Adaptive Dynamic Programming Control","score":0.5390999913215637,"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/T12794","display_name":"Adaptive Dynamic Programming Control","score":0.5390999913215637,"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/T14083","display_name":"Extremum Seeking Control Systems","score":0.1316000074148178,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"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/T10545","display_name":"Optimization and Variational Analysis","score":0.0771000012755394,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.7436000108718872},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.7268000245094299},{"id":"https://openalex.org/keywords/differential-dynamic-programming","display_name":"Differential dynamic programming","score":0.65829998254776},{"id":"https://openalex.org/keywords/filter","display_name":"Filter (signal processing)","score":0.6574000120162964},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5284000039100647},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.47780001163482666},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.46070000529289246},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.43720000982284546}],"concepts":[{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.7436000108718872},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.7268000245094299},{"id":"https://openalex.org/C92292787","wikidata":"https://www.wikidata.org/wiki/Q5275342","display_name":"Differential dynamic programming","level":3,"score":0.65829998254776},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.6574000120162964},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5284000039100647},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4966999888420105},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.47780001163482666},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.46070000529289246},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4569999873638153},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.43720000982284546},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43470001220703125},{"id":"https://openalex.org/C93226319","wikidata":"https://www.wikidata.org/wiki/Q193137","display_name":"Differential (mechanical device)","level":2,"score":0.4180999994277954},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.3894999921321869},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.36010000109672546},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.35280001163482666},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3287999927997589},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.31299999356269836},{"id":"https://openalex.org/C70518719","wikidata":"https://www.wikidata.org/wiki/Q16928317","display_name":"Recursive filter","level":5,"score":0.302700012922287},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2825999855995178},{"id":"https://openalex.org/C117898588","wikidata":"https://www.wikidata.org/wiki/Q6664310","display_name":"Local convergence","level":3,"score":0.262800008058548},{"id":"https://openalex.org/C48753275","wikidata":"https://www.wikidata.org/wiki/Q11216","display_name":"Numerical analysis","level":2,"score":0.2567000091075897},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.2531999945640564}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.01487","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.01487","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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.01487","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.01487","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":"Preprint"},"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":{"In":[0],"this":[1,104],"article,":[2],"we":[3],"establish":[4,86],"the":[5,10,15,45,65,70,87,103,108,116,128],"global":[6,88,120],"convergence":[7,89,121],"properties":[8,110],"of":[9,22,28,58,72,90,98,118,122,130],"FilterDDP":[11,47,91],"algorithm,":[12],"which":[13],"extends":[14],"discrete-time":[16],"differential":[17],"dynamic":[18],"programming":[19,68],"(DDP)":[20],"algorithm":[21],"Mayne":[23],"and":[24,40,81,132],"Jacobson":[25],"[\\emph{International":[26],"Journal":[27,135],"Control},":[29],"3,":[30],"(1966),":[31],"pp.":[32,140],"85-95]":[33],"to":[34,44],"handle":[35],"nonlinear":[36,67],"constraints":[37],"over":[38],"states":[39],"controls,":[41],"in":[42,64],"addition":[43],"dynamics.":[46],"adopts":[48],"a":[49,59,73,78,82,96,112,123],"line-search":[50,124],"filter":[51,125],"procedure":[52,106],"for":[53,95,115],"step":[54,62,114],"acceptance.":[55],"However,":[56],"instead":[57],"damped":[60],"Newton":[61,113],"applied":[63],"general":[66],"setting,":[69],"computation":[71],"trial":[74],"point":[75],"involves":[76],"applying":[77],"backward":[79],"recursion":[80],"forward":[83],"simulation.":[84],"We":[85],"by":[92],"showing":[93],"that":[94],"subset":[97],"constrained":[99],"optimal":[100],"control":[101],"problems,":[102],"backward-forward":[105],"satisfies":[107],"same":[109],"as":[111],"purpose":[117],"establishing":[119],"method,":[126],"following":[127],"analysis":[129],"W\u00e4chter":[131],"Biegler":[133],"[\\emph{SIAM":[134],"on":[136],"Optimization},":[137],"16":[138],"(2005),":[139],"1-31].":[141]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-03T00:00:00"}