{"id":"https://openalex.org/W1992208280","doi":"https://doi.org/10.1137/070704277","title":"Robust Stochastic Approximation Approach to Stochastic Programming","display_name":"Robust Stochastic Approximation Approach to Stochastic Programming","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W1992208280","doi":"https://doi.org/10.1137/070704277","mag":"1992208280"},"language":"en","primary_location":{"id":"doi:10.1137/070704277","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070704277","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018700487","display_name":"Arkadi Nemirovski","orcid":"https://orcid.org/0000-0002-5001-7420"},"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":"A. Nemirovski","raw_affiliation_strings":["nemirovs@isye.gatech.edu and glan@isye.gatech.edu and ashapiro@isye.gatech.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"nemirovs@isye.gatech.edu and glan@isye.gatech.edu and ashapiro@isye.gatech.edu#TAB#","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039659947","display_name":"Anatoli Juditsky","orcid":"https://orcid.org/0000-0001-5231-363X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A. Juditsky","raw_affiliation_strings":["Anatoli.Juditsky@imag.fr#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Anatoli.Juditsky@imag.fr#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042544900","display_name":"Guanghui Lan","orcid":"https://orcid.org/0000-0002-2103-087X"},"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":"G. Lan","raw_affiliation_strings":["School of Industrial and Systems Engineering, Georgia Tech"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Industrial and Systems Engineering, Georgia Tech","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025917676","display_name":"Alexander Shapiro","orcid":"https://orcid.org/0000-0002-4776-0053"},"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":"A. Shapiro","raw_affiliation_strings":["School of Industrial and Systems Engineering, Georgia Tech"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Industrial and Systems Engineering, Georgia Tech","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":56.3774,"has_fulltext":false,"cited_by_count":2103,"citation_normalized_percentile":{"value":0.99954145,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"19","issue":"4","first_page":"1574","last_page":"1609"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9995999932289124,"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.9995999932289124,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9987000226974487,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.6939491629600525},{"id":"https://openalex.org/keywords/subgradient-method","display_name":"Subgradient method","score":0.6894111633300781},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6639294624328613},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.6181917190551758},{"id":"https://openalex.org/keywords/saddle-point","display_name":"Saddle point","score":0.5990376472473145},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.5812960863113403},{"id":"https://openalex.org/keywords/stochastic-approximation","display_name":"Stochastic approximation","score":0.5309937000274658},{"id":"https://openalex.org/keywords/saddle","display_name":"Saddle","score":0.45067644119262695},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.44753479957580566},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.42851340770721436},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.35686856508255005},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3481432795524597},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.271229088306427}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6939491629600525},{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.6894111633300781},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6639294624328613},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.6181917190551758},{"id":"https://openalex.org/C2681867","wikidata":"https://www.wikidata.org/wiki/Q690935","display_name":"Saddle point","level":2,"score":0.5990376472473145},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.5812960863113403},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.5309937000274658},{"id":"https://openalex.org/C2777127463","wikidata":"https://www.wikidata.org/wiki/Q10862618","display_name":"Saddle","level":2,"score":0.45067644119262695},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.44753479957580566},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.42851340770721436},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.35686856508255005},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3481432795524597},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.271229088306427},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/070704277","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070704277","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-00976649v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00976649","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Optimization, 2009, 19 (4), pp.1574-1609. ⟨10.1137/070704277⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W203276351","https://openalex.org/W1490324987","https://openalex.org/W1505731132","https://openalex.org/W1752958389","https://openalex.org/W1852945463","https://openalex.org/W1972711404","https://openalex.org/W1983916623","https://openalex.org/W1994616650","https://openalex.org/W1995033525","https://openalex.org/W1999678910","https://openalex.org/W2000257769","https://openalex.org/W2000953623","https://openalex.org/W2006118023","https://openalex.org/W2033468335","https://openalex.org/W2038407338","https://openalex.org/W2038669746","https://openalex.org/W2048923650","https://openalex.org/W2053924317","https://openalex.org/W2064076655","https://openalex.org/W2070589948","https://openalex.org/W2086161653","https://openalex.org/W2090359754","https://openalex.org/W2095962350","https://openalex.org/W2162746441","https://openalex.org/W2166365115","https://openalex.org/W2169713291","https://openalex.org/W2311126677"],"related_works":["https://openalex.org/W1758974965","https://openalex.org/W4298155671","https://openalex.org/W4318598368","https://openalex.org/W2012437081","https://openalex.org/W4254717236","https://openalex.org/W2377757044","https://openalex.org/W4221167213","https://openalex.org/W3160952126","https://openalex.org/W2281909915","https://openalex.org/W2950466654"],"abstract_inverted_index":{"In":[0],"this":[1,44],"paper":[2,45],"we":[3],"consider":[4],"optimization":[5,26],"problems":[6,27,155],"where":[7],"the":[8,17,30,59,64,72,85,97,101,132,145,148],"objective":[9],"function":[10],"is":[11,28,46,83,104],"given":[12],"in":[13,113],"a":[14,78,91,105,120,136],"form":[15],"of":[16,22,43,96,139,150,164],"expectation.":[18],"A":[19],"basic":[20],"difficulty":[21],"solving":[23],"such":[24],"stochastic":[25,60,141,152],"that":[29,84,119],"involved":[31],"multidimensional":[32],"integrals":[33],"(expectations)":[34],"cannot":[35],"be":[36,126],"computed":[37],"with":[38],"high":[39],"accuracy.":[40],"The":[41],"aim":[42],"to":[47,117,147],"compare":[48],"two":[49],"computational":[50],"approaches":[51],"based":[52],"on":[53],"Monte":[54],"Carlo":[55],"sampling":[56],"techniques,":[57],"namely,":[58],"approximation":[61,67],"(SA)":[62],"and":[63,74,128,156],"sample":[65],"average":[66],"(SAA)":[68],"methods.":[69],"Both":[70],"approaches,":[71],"SA":[73,102,123],"SAA":[75,86,133],"methods,":[76],"have":[77],"long":[79],"history.":[80],"Current":[81],"opinion":[82,160],"method":[87,134],"can":[88,125],"efficiently":[89],"use":[90],"specific":[92],"(say,":[93],"linear)":[94],"structure":[95],"considered":[98],"problem,":[99],"while":[100],"approach":[103,124],"crude":[106],"subgradient":[107],"method,":[108],"which":[109],"often":[110],"performs":[111],"poorly":[112],"practice.":[114],"We":[115,143],"intend":[116],"demonstrate":[118],"properly":[121],"modified":[122],"competitive":[127],"even":[129],"significantly":[130],"outperform":[131],"for":[135],"certain":[137],"class":[138],"convex":[140],"problems.":[142],"extend":[144],"analysis":[146],"case":[149],"convex-concave":[151],"saddle":[153],"point":[154],"present":[157],"(in":[158],"our":[159],"highly":[161],"encouraging)":[162],"results":[163],"numerical":[165],"experiments.":[166]},"counts_by_year":[{"year":2026,"cited_by_count":42},{"year":2025,"cited_by_count":96},{"year":2024,"cited_by_count":116},{"year":2023,"cited_by_count":112},{"year":2022,"cited_by_count":127},{"year":2021,"cited_by_count":225},{"year":2020,"cited_by_count":223},{"year":2019,"cited_by_count":231},{"year":2018,"cited_by_count":183},{"year":2017,"cited_by_count":140},{"year":2016,"cited_by_count":143},{"year":2015,"cited_by_count":114},{"year":2014,"cited_by_count":110},{"year":2013,"cited_by_count":84},{"year":2012,"cited_by_count":84}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2025-10-10T00:00:00"}