{"id":"https://openalex.org/W1998880679","doi":"https://doi.org/10.1137/120894464","title":"On Stochastic Subgradient Mirror-Descent Algorithm with Weighted Averaging","display_name":"On Stochastic Subgradient Mirror-Descent Algorithm with Weighted Averaging","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W1998880679","doi":"https://doi.org/10.1137/120894464","mag":"1998880679"},"language":"en","primary_location":{"id":"doi:10.1137/120894464","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120894464","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/A5110629459","display_name":"Angelia Nedi\u0107","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Angelia Nedi\u0107","raw_affiliation_strings":["University of Illinois at Urbana Champaign"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana Champaign","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100734097","display_name":"Soomin Lee","orcid":"https://orcid.org/0000-0003-3959-6473"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Soomin Lee","raw_affiliation_strings":["University of Illinois at Urbana Champaign"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana Champaign","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":14.6338,"has_fulltext":false,"cited_by_count":103,"citation_normalized_percentile":{"value":0.98808262,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"24","issue":"1","first_page":"84","last_page":"107"},"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.9997000098228455,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9850000143051147,"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/subgradient-method","display_name":"Subgradient method","score":0.9539221525192261},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8674379587173462},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.6376402378082275},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5520327091217041},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5385225415229797},{"id":"https://openalex.org/keywords/stochastic-gradient-descent","display_name":"Stochastic gradient descent","score":0.5171560645103455},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.4439123272895813},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.43442052602767944},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4328416585922241},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40728458762168884},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3512515425682068},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08331170678138733},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07023432850837708}],"concepts":[{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.9539221525192261},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8674379587173462},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.6376402378082275},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5520327091217041},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5385225415229797},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.5171560645103455},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4439123272895813},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.43442052602767944},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4328416585922241},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40728458762168884},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3512515425682068},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08331170678138733},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07023432850837708},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"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/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/120894464","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120894464","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:CiteSeerX.psu:10.1.1.745.1952","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.745.1952","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1307.1879.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1992208280","https://openalex.org/W1995033525","https://openalex.org/W2016384870","https://openalex.org/W2020929673","https://openalex.org/W2024484010","https://openalex.org/W2045744861","https://openalex.org/W2063746322","https://openalex.org/W2086161653","https://openalex.org/W2100556411","https://openalex.org/W2166365115","https://openalex.org/W2169713291"],"related_works":["https://openalex.org/W2128927076","https://openalex.org/W2465405765","https://openalex.org/W4297153560","https://openalex.org/W2964186284","https://openalex.org/W2804400349","https://openalex.org/W3084689723","https://openalex.org/W2140018151","https://openalex.org/W3161275408","https://openalex.org/W3088056528","https://openalex.org/W2811183536"],"abstract_inverted_index":{"This":[0],"paper":[1],"considers":[2],"stochastic":[3,16,119],"subgradient":[4,17,120],"mirror-descent":[5,18,121],"method":[6,19],"for":[7,94,102,110,161],"solving":[8],"constrained":[9],"convex":[10,96,104],"minimization":[11],"problems.":[12],"In":[13],"particular,":[14],"a":[15,118,127],"with":[20,68,122,136],"weighted":[21,56],"iterate-averaging":[22],"is":[23,30,38,115],"investigated":[24],"and":[25,98],"its":[26],"per-iterate":[27],"convergence":[28],"rate":[29,89,100],"analyzed.":[31],"The":[32,148],"novel":[33],"part":[34],"of":[35,42,54,90,139,163],"the":[36,40,49,52,61,76,82,88,91,99,111,137,140,153],"approach":[37],"in":[39,75],"choice":[41],"weights":[43],"that":[44,60,117,151],"are":[45,156],"used":[46],"to":[47,129],"construct":[48],"averages.":[50],"Through":[51],"use":[53],"these":[55],"averages,":[57],"we":[58],"show":[59],"known":[62],"optimal":[63,131],"rates":[64,155],"can":[65,86],"be":[66],"obtained":[67],"simpler":[69],"algorithms":[70],"than":[71],"those":[72,157],"currently":[73],"existing":[74],"literature.":[77],"Specifically,":[78],"by":[79,159],"suitably":[80],"choosing":[81],"stepsize":[83,138,149],"values,":[84],"one":[85],"obtain":[87],"order":[92],"$1/k$":[93],"strongly":[95],"functions,":[97],"$1/\\sqrt{k}$":[101],"general":[103],"functions":[105],"(not":[106],"necessarily":[107],"differentiable).":[108],"Furthermore,":[109],"latter":[112],"case,":[113],"it":[114],"shown":[116],"iterate":[123],"averaging":[124],"converges":[125],"(along":[126],"subsequence)":[128],"an":[130],"solution,":[132],"almost":[133],"surely,":[134],"even":[135],"form":[141],"$1/\\sqrt{1+k}$,":[142],"which":[143],"was":[144],"not":[145],"previously":[146],"known.":[147],"choices":[150],"achieve":[152],"best":[154],"proposed":[158],"Tseng":[160],"acceleration":[162],"proximal":[164],"gradient":[165],"methods":[166],"[P.":[167],"Tseng,":[168],"SIAM":[169],"J.":[170],"Optim.,":[171],"submitted].":[172]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":13},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":15},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}