{"id":"https://openalex.org/W3008600123","doi":"https://doi.org/10.1137/17m1134925","title":"On the Convergence of Mirror Descent beyond Stochastic Convex Programming","display_name":"On the Convergence of Mirror Descent beyond Stochastic Convex Programming","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3008600123","doi":"https://doi.org/10.1137/17m1134925","mag":"3008600123"},"language":"en","primary_location":{"id":"doi:10.1137/17m1134925","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1134925","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":true,"oa_status":"green","oa_url":"https://hal.science/hal-01643346","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088606320","display_name":"Zhengyuan Zhou","orcid":"https://orcid.org/0000-0002-0005-9411"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]},{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Zhengyuan Zhou","raw_affiliation_strings":["Department of Electrical Engineering [Stanford] (Stanford University, School of Engineering, David Packard Building, 350 Serra Mall, Stanford, CA 94305-9505 - United States)","IBM Watson Research Center (PO Box 704, Yorktown Heights, NY 10598 - United States)"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering [Stanford] (Stanford University, School of Engineering, David Packard Building, 350 Serra Mall, Stanford, CA 94305-9505 - United States)","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"IBM Watson Research Center (PO Box 704, Yorktown Heights, NY 10598 - United States)","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018966648","display_name":"Panayotis Mertikopoulos","orcid":"https://orcid.org/0000-0003-2026-9616"},"institutions":[{"id":"https://openalex.org/I4210104430","display_name":"Laboratoire d'Informatique de Grenoble","ror":"https://ror.org/01c8rcg82","country_code":"FR","type":"facility","lineage":["https://openalex.org/I106785703","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210104430","https://openalex.org/I4210159245","https://openalex.org/I899635006","https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Panayotis Mertikopoulos","raw_affiliation_strings":["POLARIS - Performance analysis and optimization of LARge Infrastructures and Systems (Laboratoire LIG - B\u00e2timent IMAG - 700 avenue Centrale, CS 40700 - 38058 Grenoble cedex 9 - France)"],"affiliations":[{"raw_affiliation_string":"POLARIS - Performance analysis and optimization of LARge Infrastructures and Systems (Laboratoire LIG - B\u00e2timent IMAG - 700 avenue Centrale, CS 40700 - 38058 Grenoble cedex 9 - France)","institution_ids":["https://openalex.org/I4210104430"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002056995","display_name":"Nicholas Bambos","orcid":"https://orcid.org/0000-0001-9250-4553"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nicholas Bambos","raw_affiliation_strings":["Department of Electrical Engineering [Stanford] (Stanford University, School of Engineering, David Packard Building, 350 Serra Mall, Stanford, CA 94305-9505 - United States)"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering [Stanford] (Stanford University, School of Engineering, David Packard Building, 350 Serra Mall, Stanford, CA 94305-9505 - United States)","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011176205","display_name":"Stephen Boyd","orcid":"https://orcid.org/0000-0001-8353-6000"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stephen P. Boyd","raw_affiliation_strings":["Department of Electrical Engineering [Stanford] (Stanford University, School of Engineering, David Packard Building, 350 Serra Mall, Stanford, CA 94305-9505 - United States)"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering [Stanford] (Stanford University, School of Engineering, David Packard Building, 350 Serra Mall, Stanford, CA 94305-9505 - United States)","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019114258","display_name":"Peter W. Glynn","orcid":"https://orcid.org/0000-0003-1370-6638"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Peter W. Glynn","raw_affiliation_strings":["Department of Electrical Engineering [Stanford] (Stanford University, School of Engineering, David Packard Building, 350 Serra Mall, Stanford, CA 94305-9505 - United States)"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering [Stanford] (Stanford University, School of Engineering, David Packard Building, 350 Serra Mall, Stanford, CA 94305-9505 - United States)","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5088606320"],"corresponding_institution_ids":["https://openalex.org/I1341412227","https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":2.5186,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.91214764,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"30","issue":"1","first_page":"687","last_page":"716"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9998999834060669,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9937000274658203,"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/maxima-and-minima","display_name":"Maxima and minima","score":0.6453248858451843},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5934394598007202},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5908750891685486},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.569796085357666},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5237303376197815},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5214728116989136},{"id":"https://openalex.org/keywords/stochastic-gradient-descent","display_name":"Stochastic gradient descent","score":0.46643662452697754},{"id":"https://openalex.org/keywords/convergence-of-random-variables","display_name":"Convergence of random variables","score":0.46279358863830566},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.4566537141799927},{"id":"https://openalex.org/keywords/local-convergence","display_name":"Local convergence","score":0.44109126925468445},{"id":"https://openalex.org/keywords/ergodic-theory","display_name":"Ergodic theory","score":0.43703776597976685},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.4364657998085022},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3903428614139557},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3382404148578644},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.161454975605011},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.11891293525695801},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.08842906355857849},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07013118267059326}],"concepts":[{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.6453248858451843},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5934394598007202},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5908750891685486},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.569796085357666},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5237303376197815},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5214728116989136},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.46643662452697754},{"id":"https://openalex.org/C95763700","wikidata":"https://www.wikidata.org/wiki/Q578985","display_name":"Convergence of random variables","level":3,"score":0.46279358863830566},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4566537141799927},{"id":"https://openalex.org/C117898588","wikidata":"https://www.wikidata.org/wiki/Q6664310","display_name":"Local convergence","level":3,"score":0.44109126925468445},{"id":"https://openalex.org/C122044880","wikidata":"https://www.wikidata.org/wiki/Q5498822","display_name":"Ergodic theory","level":2,"score":0.43703776597976685},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.4364657998085022},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3903428614139557},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3382404148578644},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.161454975605011},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.11891293525695801},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.08842906355857849},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07013118267059326},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/17m1134925","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1134925","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-01643346v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01643346","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Optimization, 2020, 30 (1), pp.687-716. ⟨10.1137/17M1134925⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01643346v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01643346","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Optimization, 2020, 30 (1), pp.687-716. ⟨10.1137/17M1134925⟩","raw_type":"Journal articles"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.4300000071525574,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1487404723","https://openalex.org/W1987083649","https://openalex.org/W1990585910","https://openalex.org/W1992208280","https://openalex.org/W1994616650","https://openalex.org/W1998880679","https://openalex.org/W2011243226","https://openalex.org/W2016384870","https://openalex.org/W2020929673","https://openalex.org/W2026258334","https://openalex.org/W2033468335","https://openalex.org/W2067535145","https://openalex.org/W2069317438","https://openalex.org/W2089559088","https://openalex.org/W2090376964","https://openalex.org/W2091998586","https://openalex.org/W2123825652","https://openalex.org/W2124181538","https://openalex.org/W2150865801","https://openalex.org/W2169713291","https://openalex.org/W2409973437","https://openalex.org/W2524610192","https://openalex.org/W2551645646","https://openalex.org/W2783096200","https://openalex.org/W2963470657","https://openalex.org/W4206742934","https://openalex.org/W4292022450"],"related_works":["https://openalex.org/W4286899070","https://openalex.org/W4323366756","https://openalex.org/W2913271688","https://openalex.org/W4234593354","https://openalex.org/W2893302333","https://openalex.org/W4285259204","https://openalex.org/W4389775782","https://openalex.org/W3207830353","https://openalex.org/W3024083111","https://openalex.org/W2963926425"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,27,45,58,129],"examine":[4],"the":[5,32,49,67,97,127,135,168],"convergence":[6,84,111,136,183],"of":[7,13,35,78,85,99,138,163,170],"mirror":[8,87],"descent":[9,88],"in":[10,140,159,167],"a":[11,75,113,119,156,160],"class":[12],"stochastic":[14,101],"optimization":[15,102],"problems":[16,141],"that":[17,60,105,186],"are":[18,187],"not":[19,108],"necessarily":[20],"convex":[21,43],"(or":[22],"even":[23,166],"quasi-convex)":[24],"and":[25,57],"which":[26,81],"call":[28],"variationally":[29],"coherent.":[30,71],"Since":[31],"standard":[33],"technique":[34],"\u201cergodic":[36],"averaging\u201d":[37],"offers":[38],"no":[39],"tangible":[40],"benefits":[41],"beyond":[42],"programming,":[44],"focus":[46],"directly":[47],"on":[48,126],"algorithm's":[50],"last":[51],"generated":[52],"sample":[53],"(its":[54],"\u201clast":[55],"iterate''),":[56],"show":[59],"it":[61],"converges":[62],"with":[63,90,142,180],"probabiility":[64],"1":[65],"if":[66],"underlying":[68],"problem":[69],"is":[70,107,176],"We":[72],"further":[73],"consider":[74],"localized":[76],"version":[77],"variational":[79,117],"coherence":[80],"ensures":[82],"local":[83],"Stochastic":[86],"(SMD)":[89],"high":[91],"probability.":[92],"These":[93],"results":[94],"contribute":[95],"to":[96,112,177],"landscape":[98],"nonconvex":[100],"by":[103],"showing":[104],"(quasi-)convexity":[106],"essential":[109],"for":[110],"global":[114],"minimum:":[115],"rather,":[116],"coherence,":[118],"much":[120],"weaker":[121],"requirement,":[122],"suffices.":[123],"Finally,":[124],"building":[125],"above,":[128],"reveal":[130],"an":[131],"interesting":[132],"insight":[133],"regarding":[134],"speed":[137],"SMD:":[139],"sharp":[143],"minima":[144],"(such":[145],"as":[146],"generic":[147],"linear":[148],"programs":[149],"or":[150],"concave":[151],"minimization":[152],"problems),":[153],"SMD":[154],"reaches":[155],"minimum":[157],"point":[158],"finite":[161],"number":[162],"steps":[164],"(a.s.),":[165],"presence":[169],"persistent":[171],"gradient":[172],"noise.":[173],"This":[174],"result":[175],"be":[178],"contrasted":[179],"existing":[181],"black-box":[182],"rate":[184],"estimates":[185],"only":[188],"asymptotic.":[189]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":7}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}