{"id":"https://openalex.org/W2996830458","doi":"https://doi.org/10.1007/s10107-022-01875-8","title":"Stochastic dual dynamic programming for multistage stochastic mixed-integer nonlinear optimization","display_name":"Stochastic dual dynamic programming for multistage stochastic mixed-integer nonlinear optimization","publication_year":2022,"publication_date":"2022-08-20","ids":{"openalex":"https://openalex.org/W2996830458","doi":"https://doi.org/10.1007/s10107-022-01875-8","mag":"2996830458"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-022-01875-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-022-01875-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-022-01875-8.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10107-022-01875-8.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101945838","display_name":"Shixuan Zhang","orcid":"https://orcid.org/0000-0002-0606-4756"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shixuan Zhang","raw_affiliation_strings":["H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA"],"affiliations":[{"raw_affiliation_string":"H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004028534","display_name":"Xu Andy Sun","orcid":"https://orcid.org/0000-0003-3917-9418"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Xu Andy Sun","raw_affiliation_strings":["Sloan School of Management, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Sloan School of Management, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5004028534"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2190,"currency":"EUR","value_usd":2890},"fwci":3.22,"has_fulltext":true,"cited_by_count":27,"citation_normalized_percentile":{"value":0.91972189,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":"196","issue":"1-2","first_page":"935","last_page":"985"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.998199999332428,"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.998199999332428,"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/T10969","display_name":"Water resources management and optimization","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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.9667999744415283,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6133953332901001},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4588286578655243},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.412422239780426},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3983196020126343},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.279134064912796},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08050641417503357}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6133953332901001},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4588286578655243},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.412422239780426},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3983196020126343},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.279134064912796},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08050641417503357}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10107-022-01875-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-022-01875-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-022-01875-8.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/144396","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/144396","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Springer Berlin Heidelberg","raw_type":"http://purl.org/eprint/type/JournalArticle"}],"best_oa_location":{"id":"doi:10.1007/s10107-022-01875-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-022-01875-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-022-01875-8.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2833646551","display_name":null,"funder_award_id":"1751747","funder_id":"https://openalex.org/F4320332170","funder_display_name":"Directorate for Engineering"}],"funders":[{"id":"https://openalex.org/F4320332170","display_name":"Directorate for Engineering","ror":"https://ror.org/00b6sbb32"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2996830458.pdf","grobid_xml":"https://content.openalex.org/works/W2996830458.grobid-xml"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W21526160","https://openalex.org/W1965328823","https://openalex.org/W1977383168","https://openalex.org/W1992878760","https://openalex.org/W1995265117","https://openalex.org/W1996934332","https://openalex.org/W2019710194","https://openalex.org/W2038426159","https://openalex.org/W2043633286","https://openalex.org/W2044121814","https://openalex.org/W2048211275","https://openalex.org/W2070063615","https://openalex.org/W2105560970","https://openalex.org/W2108062921","https://openalex.org/W2109007386","https://openalex.org/W2126419180","https://openalex.org/W2132388847","https://openalex.org/W2145175411","https://openalex.org/W2148363893","https://openalex.org/W2161197409","https://openalex.org/W2164189122","https://openalex.org/W2165940683","https://openalex.org/W2170007044","https://openalex.org/W2174580403","https://openalex.org/W2336243738","https://openalex.org/W2546532603","https://openalex.org/W2728535295","https://openalex.org/W2790253573","https://openalex.org/W2793533899","https://openalex.org/W2803443353","https://openalex.org/W2804352748","https://openalex.org/W2900688122","https://openalex.org/W2901838001","https://openalex.org/W2948446629","https://openalex.org/W2962879290","https://openalex.org/W3084898007","https://openalex.org/W3094694511","https://openalex.org/W6601671484"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2051487156","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596"],"abstract_inverted_index":{"Abstract":[0],"In":[1,107],"this":[2,352],"paper,":[3],"we":[4,148,313],"study":[5,381],"multistage":[6,22,31,375,396],"stochastic":[7,23,32,38,51,123,376,397],"mixed-integer":[8,33,398],"nonlinear":[9],"programs":[10],"(MS-MINLP).":[11],"This":[12,90,267],"general":[13,226,393],"class":[14,373],"of":[15,60,69,87,103,153,155,289,349,374,395],"problems":[16],"encompasses,":[17],"as":[18,362,364],"important":[19],"special":[20],"cases,":[21],"convex":[24,265],"optimization":[25,360],"with":[26,45,130,343],"non-Lipschitzian":[27],"value":[28],"functions":[29],"and":[30,50,192],"linear":[34],"optimization.":[35,399],"We":[36,97,291],"develop":[37],"dual":[39],"dynamic":[40],"programming":[41],"(SDDP)":[42],"type":[43,59],"algorithms":[44,76,361],"nested":[46],"decomposition,":[47],"deterministic":[48,158],"sampling,":[49],"sampling.":[52],"The":[53,378],"key":[54],"ingredient":[55],"is":[56,161,193,353],"a":[57,110,315,371,383],"new":[58,75],"cuts":[61],"based":[62],"on":[63,286,300],"generalized":[64],"conjugacy.":[65],"Several":[66],"interesting":[67],"classes":[68],"MS-MINLP":[70],"are":[71,77,274,308,333],"identified,":[72],"where":[73],"the":[74,81,85,93,100,104,151,156,225,264,270,281,287,295,305,330,338,347,354,386,392],"guaranteed":[78],"to":[79,135,341],"obtain":[80,136],"global":[82,359],"optimum":[83],"without":[84],"assumption":[86],"complete":[88],"recourse.":[89],"significantly":[91],"generalizes":[92],"classic":[94],"SDDP":[95],"algorithms.":[96,106],"also":[98,278],"characterize":[99],"iteration":[101,282,296,365,379],"complexity":[102,272,283,297,366,380],"proposed":[105,157],"particular,":[108],"for":[109,224,263,368],"$$(T+1)$$":[111],"<mml:math":[112,140,168,200,233,318],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[113,141,169,201,234,319],"<mml:mrow>":[114,170,174,177,202,206,209,212,235,239,242,245,252,320],"<mml:mo>(</mml:mo>":[115,172,175,204,207,237,240,321],"<mml:mi>T</mml:mi>":[116,180,322],"<mml:mo>+</mml:mo>":[117],"<mml:mn>1</mml:mn>":[118,257],"<mml:mo>)</mml:mo>":[119,184,188,217,221,250,260,324],"</mml:mrow>":[120,181,185,189,211,215,218,222,244,248,251,258,261,325],"</mml:math>":[121,143,190,223,262,326],"-stage":[122],"MINLP":[124],"satisfying":[125],"L":[126],"-exact":[127],"Lipschitz":[128],"regularization":[129],"d":[131],"-dimensional":[132],"state":[133,306,331],"spaces,":[134],"an":[137],"$$\\varepsilon":[138],"$$":[139],"<mml:mi>\u03b5</mml:mi>":[142,182,214,247,323],"-optimal":[144,327],"root":[145],"node":[146],"solution,":[147],"prove":[149],"that":[150,269,280,294,357],"number":[152,288],"iterations":[154],"sampling":[159],"algorithm":[160],"upper":[162],"bounded":[163,195],"by":[164,196,229,385],"$${\\mathcal":[165,197,230],"{O}}((\\frac{2LT}{\\varepsilon":[166],"})^d)$$":[167,199],"<mml:mi>O</mml:mi>":[171,203,236],"<mml:msup>":[173,205,238],"<mml:mfrac>":[176,208,241],"<mml:mn>2</mml:mn>":[178,255],"<mml:mi>L</mml:mi>":[179],"</mml:mfrac>":[183,216,249],"<mml:mi>d</mml:mi>":[186,219,253],"</mml:msup>":[187,220,259],",":[191,302],"lower":[194],"{O}}((\\frac{LT}{4\\varepsilon":[198],"<mml:mi>LT</mml:mi>":[210,243],"<mml:mn>4</mml:mn>":[213],"case":[227],"or":[228,311],"{O}}((\\frac{LT}{8\\varepsilon":[231],"})^{d/2-1})$$":[232],"<mml:mn>8</mml:mn>":[246],"<mml:mo>/</mml:mo>":[254],"<mml:mo>-</mml:mo>":[256],"case.":[266],"shows":[268],"obtained":[271],"bounds":[273],"rather":[275],"sharp.":[276],"It":[277],"reveals":[279],"depends":[284,298],"polynomially":[285],"stages.":[290],"further":[292],"show":[293],"linearly":[299],"T":[301,344],"if":[303,312],"all":[304],"spaces":[307,332],"finite":[309],"sets,":[310,335],"seek":[314],"$$(T\\varepsilon":[316],")$$":[317],"solution":[328],"when":[329],"infinite":[334],"i.e.":[336],"allowing":[337],"optimality":[339],"gap":[340],"scale":[342],".":[345],"To":[346],"best":[348],"our":[350],"knowledge,":[351],"first":[355],"work":[356],"reports":[358],"well":[363],"results":[367],"solving":[369],"such":[370],"large":[372],"programs.":[377],"resolves":[382],"conjecture":[384],"late":[387],"Prof.":[388],"Shabbir":[389],"Ahmed":[390],"in":[391],"setting":[394]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}