{"id":"https://openalex.org/W7214984092","doi":"https://doi.org/10.48550/arxiv.2609.36275","title":"Soft Separation for Adaptive Robust Optimization","display_name":"Soft Separation for Adaptive Robust Optimization","publication_year":2026,"publication_date":"2026-09-28","ids":{"openalex":"https://openalex.org/W7214984092","doi":"https://doi.org/10.48550/arxiv.2609.36275"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.36275","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.36275","pdf_url":"https://arxiv.org/pdf/2609.36275","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/2609.36275","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112440704","display_name":"Qiang Xu","orcid":"https://orcid.org/0000-0003-1304-4742","observed_orcids":["https://orcid.org/0000-0003-1304-4742","https://orcid.org/0009-0004-8413-5662"]},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xu, Qingyuan","raw_affiliation_strings":["Department of Industrial and Operations Engineering , University of Michigan , {qyxu ,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial and Operations Engineering , University of Michigan , {qyxu ,","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087268135","display_name":"Ruiwei Jiang","orcid":"https://orcid.org/0000-0002-3941-5057","observed_orcids":["https://orcid.org/0000-0002-3941-5057"]},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jiang, Ruiwei","raw_affiliation_strings":["Department of Industrial and Operations Engineering , University of Michigan , {qyxu ,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial and Operations Engineering , University of Michigan , {qyxu ,","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I27837315"],"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.9082000255584717,"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.9082000255584717,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.07670000195503235,"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.002400000113993883,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/adaptive-robust-optimization","display_name":"adaptive robust optimization","score":0.9950000047683716},{"id":"https://openalex.org/keywords/non-homogeneous-markov-chains","display_name":"non-homogeneous Markov chains","score":0.9259999990463257},{"id":"https://openalex.org/keywords/worst-case-uncertainty","display_name":"worst-case uncertainty","score":0.7059999704360962},{"id":"https://openalex.org/keywords/first-order-methods","display_name":"first-order methods","score":0.5709999799728394},{"id":"https://openalex.org/keywords/polynomial-time-convergence","display_name":"polynomial-time convergence","score":0.7590000033378601},{"id":"https://openalex.org/keywords/mixed-integer-programming","display_name":"mixed integer programming","score":0.703000009059906},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"branch-and-cut","score":0.9480000138282776},{"id":"https://openalex.org/keywords/valid-cuts","display_name":"valid cuts","score":0.9610000252723694}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6144000291824341},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5813999772071838},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.545799970626831},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4991999864578247},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.49709999561309814},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4927999973297119},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4830000102519989},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42669999599456787},{"id":"https://openalex.org/C2776061190","wikidata":"https://www.wikidata.org/wiki/Q7451805","display_name":"Separation (statistics)","level":2,"score":0.4185999929904938},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.413100004196167},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.40389999747276306},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.384799987077713},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.3513999879360199},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.34850001335144043},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3386000096797943},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.3312999904155731},{"id":"https://openalex.org/C774472","wikidata":"https://www.wikidata.org/wiki/Q6760393","display_name":"Margin (machine learning)","level":2,"score":0.32600000500679016},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.3149999976158142},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.2874999940395355},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.2847999930381775},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.26980000734329224},{"id":"https://openalex.org/C96865113","wikidata":"https://www.wikidata.org/wiki/Q2946816","display_name":"Certificate","level":2,"score":0.26100000739097595},{"id":"https://openalex.org/C29282572","wikidata":"https://www.wikidata.org/wiki/Q16977029","display_name":"Derivative-free optimization","level":4,"score":0.2597000002861023},{"id":"https://openalex.org/C145671259","wikidata":"https://www.wikidata.org/wiki/Q1493786","display_name":"Discrete optimization","level":3,"score":0.25850000977516174},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.2554999887943268}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.36275","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.36275","pdf_url":"https://arxiv.org/pdf/2609.36275","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.2609.36275","doi":"https://doi.org/10.48550/arxiv.2609.36275","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.36275","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:2609.36275","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.36275","pdf_url":"https://arxiv.org/pdf/2609.36275","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/W7214984092.pdf","grobid_xml":"https://content.openalex.org/works/W7214984092.grobid-xml"},"referenced_works_count":1,"referenced_works":["https://openalex.org/W4221166569"],"related_works":["https://openalex.org/W4417428050","https://openalex.org/W6903893469","https://openalex.org/W3202913892","https://openalex.org/W7212544970","https://openalex.org/W4415249299","https://openalex.org/W2984068585","https://openalex.org/W2633897740","https://openalex.org/W4386032109","https://openalex.org/W2560859876","https://openalex.org/W2896181135"],"abstract_inverted_index":{"We":[0],"propose":[1],"an":[2,40],"algorithmic":[3],"framework":[4,20,115],"for":[5,27,120],"solving":[6,39],"adaptive":[7,90],"robust":[8,122],"optimization":[9,62],"with":[10,60,71,141],"provable":[11],"guarantees":[12],"on":[13],"both":[14],"tractability":[15],"and":[16,64,124,144,153],"solution":[17],"accuracy.":[18],"The":[19,151],"introduces":[21],"soft":[22,86,110],"separation,":[23],"a":[24,33,81,113,126],"probabilistic":[25],"mechanism":[26],"identifying":[28],"worst-case":[29],"uncertainty":[30],"realizations":[31],"via":[32],"time-inhomogeneous":[34],"Markov":[35],"chain.":[36],"Rather":[37],"than":[38],"exact":[41,66],"separation":[42,67,87,111],"problem":[43,142],"in":[44,50,98],"each":[45],"iteration,":[46],"which":[47],"is":[48],"intractable":[49],"general,":[51],"the":[52,61,101,121,136],"chain":[53],"carries":[54],"adversarial":[55],"information":[56],"across":[57],"iterations,":[58],"co-evolves":[59],"iterates,":[63],"recovers":[65],"at":[68,158],"terminal":[69],"iterates":[70],"high":[72],"probability.":[73],"For":[74,104],"continuous":[75],"first-stage":[76],"(here-and-now)":[77],"decisions,":[78,107],"we":[79,94,108],"design":[80],"first-order":[82],"method":[83],"that":[84,135],"uses":[85],"to":[88,100,116,148],"produce":[89],"gradient":[91],"estimates.":[92],"Notably,":[93],"prove":[95],"polynomial-time":[96],"convergence":[97],"expectation":[99],"global":[102,130],"optimum.":[103],"mixed-integer":[105],"here-and-now":[106],"embed":[109],"within":[112],"branch-and-cut":[114],"generate":[117],"valid":[118],"cuts":[119],"objective":[123],"obtain":[125],"high-probability":[127],"certificate":[128],"of":[129],"optimality.":[131],"Numerical":[132],"experiments":[133],"demonstrate":[134],"proposed":[137],"methods":[138],"scale":[139],"favorably":[140],"dimension":[143],"scenario":[145],"size":[146],"relative":[147],"state-of-the-art":[149],"approaches.":[150],"instances":[152],"code":[154],"are":[155],"available":[156],"online":[157],"https://github.com/xuqy2002/SoftSeparationARO.":[159]},"counts_by_year":[],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-10-01T00:00:00"}