{"id":"https://openalex.org/W7159607936","doi":"https://doi.org/10.48550/arxiv.2604.27355","title":"Over-Approximating Minimizer Sets of Constrained Convex Programs with Parametric Uncertainty via Reachability Analysis","display_name":"Over-Approximating Minimizer Sets of Constrained Convex Programs with Parametric Uncertainty via Reachability Analysis","publication_year":2026,"publication_date":"2026-04-30","ids":{"openalex":"https://openalex.org/W7159607936","doi":"https://doi.org/10.48550/arxiv.2604.27355"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.27355","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.27355","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.2604.27355","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5134962860","display_name":"Brendan Gould","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gould, Brendan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001188423","display_name":"Chih-Yuan Chiu","orcid":"https://orcid.org/0000-0002-2217-3418"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chiu, Chih-Yuan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059058827","display_name":"Antoine P. Leeman","orcid":"https://orcid.org/0000-0002-1756-9506"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Leeman, Antoine P.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134929713","display_name":"Kyriakos G. Vamvoudakis","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vamvoudakis, Kyriakos G.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010552433","display_name":"Samuel Coogan","orcid":"https://orcid.org/0000-0003-0495-1535"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Coogan, Samuel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5134930899","display_name":"Glen Chou","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chou, Glen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":6,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.36149999499320984,"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"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.36149999499320984,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.22130000591278076,"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.11079999804496765,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.6704000234603882},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.6593999862670898},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.5688999891281128},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.492000013589859},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4869999885559082},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.484499990940094},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4413999915122986},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.42489999532699585},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4207000136375427},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.3783999979496002}],"concepts":[{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.6704000234603882},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6593999862670898},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6535999774932861},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.5688999891281128},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5494999885559082},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.492000013589859},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4869999885559082},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.484499990940094},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4413999915122986},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.42489999532699585},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.421999990940094},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4207000136375427},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.3783999979496002},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.3779999911785126},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.3499000072479248},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3483999967575073},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.34119999408721924},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.3377000093460083},{"id":"https://openalex.org/C33962884","wikidata":"https://www.wikidata.org/wiki/Q378637","display_name":"Dynamical system (definition)","level":3,"score":0.3269999921321869},{"id":"https://openalex.org/C79379906","wikidata":"https://www.wikidata.org/wiki/Q3174497","display_name":"Dynamical systems theory","level":2,"score":0.3084999918937683},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.3025999963283539},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.29649999737739563},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.29170000553131104},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.2831999957561493},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.27480000257492065},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.2718999981880188},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.26429998874664307},{"id":"https://openalex.org/C200661725","wikidata":"https://www.wikidata.org/wiki/Q289500","display_name":"Subderivative","level":4,"score":0.26260000467300415},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.2606000006198883},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.2540000081062317},{"id":"https://openalex.org/C60033838","wikidata":"https://www.wikidata.org/wiki/Q1751685","display_name":"Solution set","level":3,"score":0.25049999356269836}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.27355","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.27355","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.2604.27355","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.27355","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":[{"id":"https://metadata.un.org/sdg/16","score":0.7062823176383972,"display_name":"Peace, Justice and strong institutions"}],"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,20,105],"study":[1],"the":[2,27,36,48,57,76,90,102,111,116,133],"set":[3,29],"of":[4,26,30,35,89,136],"solutions":[5],"to":[6,75,114],"a":[7,22],"parameterized,":[8],"strongly":[9],"convex":[10,43,137],"optimization":[11],"problem":[12],"whose":[13],"cost":[14,49],"depends":[15],"on":[16,110],"uncertain,":[17],"bounded":[18],"parameters.":[19],"compute":[21],"certified":[23],"outer":[24,87],"approximation":[25],"corresponding":[28],"optimizers,":[31],"using":[32],"convergence":[33],"properties":[34],"projected":[37],"gradient":[38],"descent":[39],"(PGD)":[40],"algorithm":[41],"for":[42,79],"programs.":[44],"Concretely,":[45],"by":[46],"treating":[47],"parameter":[50],"as":[51,60],"constant":[52],"but":[53],"unknown,":[54],"we":[55],"interpret":[56],"PGD":[58,72,112],"iterates":[59],"an":[61,94],"uncertain":[62,140],"dynamical":[63],"system":[64],"and":[65,119,142],"analyze":[66],"its":[67],"forward":[68],"reachable":[69,84],"sets.":[70],"Since":[71],"converges":[73],"exponentially":[74,100],"unique":[77],"optimizer":[78,91],"each":[80],"fixed":[81],"parameter,":[82],"these":[83],"sets":[85,135],"provide":[86],"approximations":[88],"set,":[92],"with":[93,101,130,139],"explicit":[95],"error":[96],"bound":[97],"that":[98],"decays":[99],"iteration":[103],"count.":[104],"apply":[106],"system-level":[107],"synthesis":[108],"(SLS)":[109],"dynamics":[113],"optimize":[115],"step-size":[117],"sequence":[118],"obtain":[120],"reachable-set":[121],"over-approximations.":[122],"Our":[123],"method":[124],"outperforms":[125],"existing":[126],"baselines":[127],"in":[128],"over-approximating,":[129],"low":[131],"conservativeness,":[132],"minimizer":[134],"programs":[138],"costs":[141],"high-dimensional":[143],"decision":[144],"variables.":[145]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-02T00:00:00"}