{"id":"https://openalex.org/W7165671211","doi":"https://doi.org/10.48550/arxiv.2606.23229","title":"Value iteration with stopping criterion: finite iterations, stability, and near-optimality guarantees","display_name":"Value iteration with stopping criterion: finite iterations, stability, and near-optimality guarantees","publication_year":2026,"publication_date":"2026-06-22","ids":{"openalex":"https://openalex.org/W7165671211","doi":"https://doi.org/10.48550/arxiv.2606.23229"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.23229","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.23229","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":null,"license_id":null,"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.23229","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060471832","display_name":"Mathieu Granzotto","orcid":"https://orcid.org/0000-0003-3830-8820"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Granzotto, Mathieu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003519273","display_name":"Romain Postoyan","orcid":"https://orcid.org/0000-0002-2454-602X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Postoyan, Romain","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139195716","display_name":"Dragan Ne\u0161i\u0107","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ne\u0161i\u0107, Dragan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058935509","display_name":"Lucian Bu\u015foniu","orcid":"https://orcid.org/0000-0001-8017-1296"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bu\u015foniu, Lucian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5139162352","display_name":"Jamal Daafouz","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daafouz, Jamal","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.48260000348091125,"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.48260000348091125,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.12939999997615814,"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/T10046","display_name":"Stability and Control of Uncertain Systems","score":0.07980000227689743,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.6514999866485596},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.5864999890327454},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5625},{"id":"https://openalex.org/keywords/optimal-stopping","display_name":"Optimal stopping","score":0.46470001339912415},{"id":"https://openalex.org/keywords/stopping-time","display_name":"Stopping time","score":0.424699991941452},{"id":"https://openalex.org/keywords/bellman-equation","display_name":"Bellman equation","score":0.4113999903202057},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.33169999718666077}],"concepts":[{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.6514999866485596},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.5864999890327454},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5857999920845032},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5625},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47099998593330383},{"id":"https://openalex.org/C99414536","wikidata":"https://www.wikidata.org/wiki/Q7098950","display_name":"Optimal stopping","level":2,"score":0.46470001339912415},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44940000772476196},{"id":"https://openalex.org/C99888217","wikidata":"https://www.wikidata.org/wiki/Q1288707","display_name":"Stopping time","level":2,"score":0.424699991941452},{"id":"https://openalex.org/C14646407","wikidata":"https://www.wikidata.org/wiki/Q1430750","display_name":"Bellman equation","level":2,"score":0.4113999903202057},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.33169999718666077},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.31200000643730164},{"id":"https://openalex.org/C2776299755","wikidata":"https://www.wikidata.org/wiki/Q432449","display_name":"Carry (investment)","level":2,"score":0.3100999891757965},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.287200003862381},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2865999937057495},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.2822999954223633},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.26409998536109924},{"id":"https://openalex.org/C5465570","wikidata":"https://www.wikidata.org/wiki/Q5326898","display_name":"Early stopping","level":3,"score":0.25040000677108765},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.25029999017715454}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.23229","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.23229","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.23229","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.23229","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Value":[0],"iteration":[1],"(VI)":[2],"is":[3,97],"a":[4,83,123,155],"cornerstone":[5],"of":[6,37,102,126],"dynamic":[7],"programming":[8],"that":[9,44,87,118,131,162],"allows":[10],"computing":[11],"near-optimal":[12],"feedback":[13],"laws":[14],"for":[15,158],"general":[16],"plant":[17],"dynamics":[18],"and":[19,48,58,105,143,168],"cost":[20],"functions.":[21],"In":[22,60],"practice,":[23],"however,":[24],"it":[25],"must":[26],"be":[27],"stopped":[28],"after":[29],"finitely":[30],"many":[31],"iterations.":[32,127],"This":[33],"raises":[34],"the":[35,41,45,100,103,109,132,140,159],"question":[36],"when":[38],"to":[39,98],"stop":[40],"algorithm":[42],"so":[43],"resulting":[46],"policies":[47,104,134],"value":[49,106],"functions":[50,107],"achieve":[51],"desirable":[52],"properties,":[53],"like":[54],"given":[55],"near-optimality":[56,146],"bounds":[57,147],"stability.":[59],"this":[61,150],"context,":[62],"we":[63,115],"study":[64],"deterministic,":[65],"discrete-time":[66],"systems":[67],"with":[68,82,166],"infinite-horizon":[69],"(possibly":[70],"discounted)":[71],"costs":[72],"whose":[73],"inputs":[74],"are":[75,135],"generated":[76],"by":[77,137,149],"VI.":[78],"We":[79,128],"equip":[80],"VI":[81,119],"generalized":[84],"stopping":[85,141,160],"criterion":[86],"encompasses":[88],"existing":[89],"choices":[90],"while":[91],"allowing":[92],"new":[93],"ones.":[94],"Our":[95],"aim":[96],"analyze":[99],"properties":[101],"at":[108],"final":[110,133],"iteration.":[111],"Under":[112],"mild":[113],"assumptions,":[114],"first":[116],"show":[117],"indeed":[120],"terminates":[121],"in":[122],"finite":[124],"number":[125],"then":[129],"establish":[130],"stabilizing":[136],"properly":[138],"designing":[139],"criterion,":[142],"derive":[144],"explicit":[145],"characterized":[148],"choice.":[151],"These":[152],"results":[153],"offer":[154],"design":[156],"framework":[157],"criteria":[161],"balances":[163],"computational":[164],"effort":[165],"stability":[167],"performance":[169],"guarantees.":[170]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-24T00:00:00"}