{"id":"https://openalex.org/W7135080348","doi":"https://doi.org/10.48550/arxiv.2603.10280","title":"Avoiding Semi-Infinite Programming in Distributionally Robust Control Based on Mean-Variance Metrics","display_name":"Avoiding Semi-Infinite Programming in Distributionally Robust Control Based on Mean-Variance Metrics","publication_year":2026,"publication_date":"2026-03-10","ids":{"openalex":"https://openalex.org/W7135080348","doi":"https://doi.org/10.48550/arxiv.2603.10280"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.10280","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.10280","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.2603.10280","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5095787382","display_name":"Yuma Shida","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shida, Yuma","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5028644363","display_name":"Yuji Ito","orcid":"https://orcid.org/0000-0002-6786-7798"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ito, Yuji","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/T11413","display_name":"Risk and Portfolio Optimization","score":0.9643999934196472,"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"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9643999934196472,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.005400000140070915,"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.004399999976158142,"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/robust-optimization","display_name":"Robust optimization","score":0.6349999904632568},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5999000072479248},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.5852000117301941},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5231999754905701},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.5023999810218811},{"id":"https://openalex.org/keywords/robust-control","display_name":"Robust control","score":0.48739999532699585},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.47540000081062317},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.4162999987602234},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.3986000120639801}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7565000057220459},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.6349999904632568},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5999000072479248},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.5852000117301941},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5231999754905701},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.5023999810218811},{"id":"https://openalex.org/C31531917","wikidata":"https://www.wikidata.org/wiki/Q915157","display_name":"Robust control","level":3,"score":0.48739999532699585},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.47540000081062317},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.4162999987602234},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4129999876022339},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3986000120639801},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.39730000495910645},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.39489999413490295},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.388700008392334},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38370001316070557},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.3815999925136566},{"id":"https://openalex.org/C170131372","wikidata":"https://www.wikidata.org/wiki/Q7617811","display_name":"Stochastic control","level":3,"score":0.32589998841285706},{"id":"https://openalex.org/C45473103","wikidata":"https://www.wikidata.org/wiki/Q851503","display_name":"Riccati equation","level":3,"score":0.3154999911785126},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.30869999527931213},{"id":"https://openalex.org/C14646407","wikidata":"https://www.wikidata.org/wiki/Q1430750","display_name":"Bellman equation","level":2,"score":0.3041999936103821},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.2985000014305115},{"id":"https://openalex.org/C98779006","wikidata":"https://www.wikidata.org/wiki/Q2520550","display_name":"Linear-quadratic regulator","level":3,"score":0.28220000863075256},{"id":"https://openalex.org/C8505890","wikidata":"https://www.wikidata.org/wiki/Q605095","display_name":"Budget constraint","level":2,"score":0.2703999876976013},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.26899999380111694},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.25130000710487366}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.10280","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.10280","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.2603.10280","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.10280","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":{"Conventional":[0],"stochastic":[1,37],"control":[2,41,94,147],"methods":[3,43],"have":[4,44],"several":[5],"limitations.":[6],"They":[7],"focus":[8],"on":[9,66,102],"optimizing":[10],"the":[11,30,35,67,83,116,130,145,153,160,165,170,178],"average":[12],"performance":[13,18],"and,":[14],"in":[15],"some":[16],"cases,":[17],"variability;":[19],"however,":[20],"their":[21],"problem":[22,133],"settings":[23],"still":[24],"require":[25],"an":[26],"explicit":[27],"specification":[28],"of":[29,164],"probability":[31],"distributions":[32],"that":[33,159,176],"determine":[34],"system's":[36],"behavior.":[38],"Distributionally":[39],"robust":[40,92,120],"(DRC)":[42],"recently":[45],"been":[46],"developed":[47],"to":[48,134],"address":[49],"these":[50],"challenges.":[51],"However,":[52],"many":[53,59],"DRC":[54,63,132],"approaches":[55],"involve":[56],"handling":[57],"infinitely":[58],"inequalities.":[60],"For":[61],"instance,":[62],"problems":[64,122],"based":[65,101],"Wasserstein":[68],"distance":[69],"are":[70,149],"commonly":[71],"obtained":[72,150],"by":[73,151],"solving":[74,88,152],"semi-infinite":[75],"programming":[76],"(SIP)":[77],"problems.":[78,95,126],"Our":[79],"proposed":[80,171],"method":[81,172],"eliminates":[82],"need":[84],"for":[85,169,177],"SIP":[86],"when":[87],"discrete-time,":[89],"discounted,":[90],"distributionally":[91,119],"optimal":[93],"By":[96],"introducing":[97],"a":[98,103,135],"penalty":[99],"term":[100],"specific":[104],"distributional":[105],"distance,":[106],"we":[107],"establish":[108],"upper":[109],"bounds,":[110],"and":[111,123],"under":[112],"appropriate":[113],"conditions,":[114],"demonstrate":[115,158],"equivalence":[117],"between":[118],"optimization":[121,139],"mean-variance":[124,137],"minimization":[125],"This":[127],"reformulation":[128],"reduces":[129],"original":[131],"discounted":[136,166],"cost":[138,168],"problem.":[140],"In":[141],"linear-quadratic":[142],"regulator":[143],"settings,":[144],"corresponding":[146],"laws":[148],"Riccati":[154],"equation.":[155],"Numerical":[156],"experiments":[157],"theoretical":[161],"maximum":[162],"value":[163],"cumulative":[167],"is":[173],"lower":[174],"than":[175],"conventional":[179],"method.":[180]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-03-13T00:00:00"}