{"id":"https://openalex.org/W7223703259","doi":"https://doi.org/10.48550/arxiv.2610.32089","title":"Timed Recovery Safe Gradient Flows for Constrained Nonlinear Programming","display_name":"Timed Recovery Safe Gradient Flows for Constrained Nonlinear Programming","publication_year":2026,"publication_date":"2026-10-23","ids":{"openalex":"https://openalex.org/W7223703259","doi":"https://doi.org/10.48550/arxiv.2610.32089"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2610.32089","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.32089","pdf_url":"https://arxiv.org/pdf/2610.32089","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2610.32089","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007542512","display_name":"Tianxi Luo","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Luo, Tianxi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5159624432","display_name":"Yue Wu","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wu, Yue","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5159682712","display_name":"Fei Chen","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Fei","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5076197013","display_name":"Hongsheng Qi","orcid":"https://orcid.org/0000-0002-1698-7570","observed_orcids":["https://orcid.org/0000-0002-1698-7570"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Qi, Hongsheng","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":true,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.5292999744415283,"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"}},"topics":[{"id":"https://openalex.org/T10791","display_name":"Advanced Control Systems Optimization","score":0.5292999744415283,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.2957000136375427,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.15760000050067902,"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/continuous-time-optimization","display_name":"continuous-time optimization","score":0.5899999737739563},{"id":"https://openalex.org/keywords/forward-invariance","display_name":"forward invariance","score":0.9049999713897705},{"id":"https://openalex.org/keywords/local-convergence","display_name":"local convergence","score":0.6010000109672546}],"concepts":[{"id":"https://openalex.org/C2777984123","wikidata":"https://www.wikidata.org/wiki/Q9248237","display_name":"Pointwise","level":2,"score":0.8282999992370605},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.5805000066757202},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5698999762535095},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5321000218391418},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5160999894142151},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.4925000071525574},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.47699999809265137},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45719999074935913},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.4512999951839447},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.4255000054836273},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41609999537467957},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41119998693466187},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.40849998593330383},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.3928000032901764},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.38760000467300415},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.3806000053882599},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.3506999909877777},{"id":"https://openalex.org/C167879884","wikidata":"https://www.wikidata.org/wiki/Q727568","display_name":"Balanced flow","level":2,"score":0.34610000252723694},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.34540000557899475},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.32589998841285706},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.3246999979019165},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29350000619888306},{"id":"https://openalex.org/C195956108","wikidata":"https://www.wikidata.org/wiki/Q7268362","display_name":"Quadratic growth","level":2,"score":0.2856999933719635},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.28139999508857727},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.27300000190734863},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.2694999873638153},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.26820001006126404},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.2621999979019165},{"id":"https://openalex.org/C27156116","wikidata":"https://www.wikidata.org/wiki/Q1778098","display_name":"Pointwise convergence","level":3,"score":0.260699987411499},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.25839999318122864},{"id":"https://openalex.org/C2776633867","wikidata":"https://www.wikidata.org/wiki/Q186612","display_name":"Timer","level":3,"score":0.25609999895095825},{"id":"https://openalex.org/C2780799671","wikidata":"https://www.wikidata.org/wiki/Q17087362","display_name":"Transient (computer programming)","level":2,"score":0.25440001487731934},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.2508000135421753}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2610.32089","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.32089","pdf_url":"https://arxiv.org/pdf/2610.32089","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2610.32089","doi":"https://doi.org/10.48550/arxiv.2610.32089","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2610.32089","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2610.32089","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.32089","pdf_url":"https://arxiv.org/pdf/2610.32089","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7223703259.pdf","grobid_xml":"https://content.openalex.org/works/W7223703259.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W111362253","https://openalex.org/W1971930451","https://openalex.org/W2057057063","https://openalex.org/W2079036541","https://openalex.org/W2086929129","https://openalex.org/W2104497095","https://openalex.org/W2123871098","https://openalex.org/W2133776435","https://openalex.org/W2145367961","https://openalex.org/W2200151548","https://openalex.org/W2517525097","https://openalex.org/W2532703171","https://openalex.org/W2560504659","https://openalex.org/W2804386772","https://openalex.org/W2889596539","https://openalex.org/W2903451074","https://openalex.org/W3044218236","https://openalex.org/W3136357470","https://openalex.org/W3161794388","https://openalex.org/W4213187536","https://openalex.org/W4315472354","https://openalex.org/W4319459406","https://openalex.org/W4385973814","https://openalex.org/W4391020211","https://openalex.org/W4404520437","https://openalex.org/W4406548562","https://openalex.org/W4410226385","https://openalex.org/W4413392771","https://openalex.org/W4415258085","https://openalex.org/W4415707053","https://openalex.org/W7092553682"],"related_works":["https://openalex.org/W4385973814","https://openalex.org/W4210279009","https://openalex.org/W7213999935","https://openalex.org/W4415707053","https://openalex.org/W7220422027","https://openalex.org/W4410029374","https://openalex.org/W7202243045","https://openalex.org/W2936870882","https://openalex.org/W7092553682","https://openalex.org/W6941218720"],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"how":[3,168],"to":[4,97,129,153],"relax":[5],"pointwise":[6,71,104],"feasibility":[7,72],"in":[8,142],"continuous-time":[9],"dynamics":[10,36,150],"for":[11,42,54],"inequality-constrained":[12],"nonlinear":[13],"programming":[14],"while":[15],"retaining":[16],"a":[17,63,84,94,103,143],"quantitative":[18],"feasible-recovery":[19],"guarantee.":[20],"Existing":[21],"safe":[22,66,114],"gradient":[23,67,100,156],"flows":[24],"enforce":[25],"forward":[26,117],"invariance":[27],"of":[28,135],"the":[29,81,88,98,111,125,148,154,160,169,173,178],"feasible":[30,75,126],"set,":[31],"which":[32],"yields":[33],"an":[34],"anytime-feasible":[35],"but":[37],"can":[38],"be":[39,52],"overly":[40],"restrictive":[41],"optimization":[43],"because":[44],"it":[45,130],"suppresses":[46],"transient":[47],"infeasible":[48,90],"motion":[49],"that":[50,69,86,110,120],"may":[51],"essential":[53],"effective":[55],"descent.":[56],"To":[57],"address":[58],"this":[59],"limitation,":[60],"we":[61],"propose":[62],"timed":[64],"recovery":[65,170],"flow":[68,101,157],"replaces":[70],"with":[73,83],"fixed-horizon":[74],"recovery.":[76],"The":[77],"proposed":[78],"construction":[79],"augments":[80],"state":[82],"timer":[85],"records":[87],"elapsed":[89],"duration":[91],"and":[92,119,158,176],"computes":[93],"minimum-norm":[95],"correction":[96],"nominal":[99,155],"through":[102],"convex":[105],"quadratic":[106],"program.":[107],"We":[108,138],"show":[109,140],"resulting":[112],"augmented":[113],"set":[115,127],"is":[116],"invariant":[118],"every":[121,132],"trajectory":[122],"initialized":[123],"from":[124],"returns":[128],"within":[131],"time":[133],"window":[134],"length":[136],"\\(\u03c4\\).":[137],"further":[139],"that,":[141],"strict":[144],"interior":[145],"inactive":[146],"regime,":[147],"closed-loop":[149,174],"reduces":[151],"exactly":[152],"recovers":[159],"corresponding":[161],"local":[162],"convergence":[163],"behavior.":[164],"Numerical":[165],"examples":[166],"illustrate":[167],"horizon":[171],"shapes":[172],"behavior":[175],"corroborate":[177],"theoretical":[179],"analysis.":[180]},"counts_by_year":[],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-10-27T00:00:00"}