{"id":"https://openalex.org/W2045744861","doi":"https://doi.org/10.1137/110848864","title":"Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework","display_name":"Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2045744861","doi":"https://doi.org/10.1137/110848864","mag":"2045744861"},"language":"en","primary_location":{"id":"doi:10.1137/110848864","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110848864","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/A5063746021","display_name":"Saeed Ghadimi","orcid":"https://orcid.org/0000-0002-3191-5153"},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Saeed Ghadimi","raw_affiliation_strings":["[University of Florida]"],"affiliations":[{"raw_affiliation_string":"[University of Florida]","institution_ids":["https://openalex.org/I33213144"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042544900","display_name":"Guanghui Lan","orcid":"https://orcid.org/0000-0002-2103-087X"},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guanghui Lan","raw_affiliation_strings":["[University of Florida]"],"affiliations":[{"raw_affiliation_string":"[University of Florida]","institution_ids":["https://openalex.org/I33213144"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5063746021"],"corresponding_institution_ids":["https://openalex.org/I33213144"],"apc_list":null,"apc_paid":null,"fwci":26.9161,"has_fulltext":false,"cited_by_count":295,"citation_normalized_percentile":{"value":0.99660934,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"22","issue":"4","first_page":"1469","last_page":"1492"},"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.9940999746322632,"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/mathematics","display_name":"Mathematics","score":0.6995657682418823},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.6123438477516174},{"id":"https://openalex.org/keywords/differentiable-function","display_name":"Differentiable function","score":0.6002100706100464},{"id":"https://openalex.org/keywords/stochastic-approximation","display_name":"Stochastic approximation","score":0.5961962342262268},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5903562903404236},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5803174376487732},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5396504402160645},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.49184107780456543},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.49013838171958923},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.4611975848674774},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.4296630620956421},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42455947399139404},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4105425477027893},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23582345247268677},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.07646310329437256}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6995657682418823},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.6123438477516174},{"id":"https://openalex.org/C202615002","wikidata":"https://www.wikidata.org/wiki/Q783507","display_name":"Differentiable function","level":2,"score":0.6002100706100464},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.5961962342262268},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5903562903404236},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5803174376487732},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5396504402160645},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.49184107780456543},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.49013838171958923},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.4611975848674774},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.4296630620956421},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42455947399139404},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4105425477027893},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23582345247268677},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.07646310329437256},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/110848864","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110848864","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W203276351","https://openalex.org/W1490324987","https://openalex.org/W1505731132","https://openalex.org/W1554944419","https://openalex.org/W1556545893","https://openalex.org/W1852945463","https://openalex.org/W1972711404","https://openalex.org/W1983916623","https://openalex.org/W1986891697","https://openalex.org/W1992208280","https://openalex.org/W1994616650","https://openalex.org/W1995033525","https://openalex.org/W1996652862","https://openalex.org/W2006118023","https://openalex.org/W2016939833","https://openalex.org/W2018493294","https://openalex.org/W2020929673","https://openalex.org/W2024484010","https://openalex.org/W2033468335","https://openalex.org/W2048923650","https://openalex.org/W2051381803","https://openalex.org/W2063746322","https://openalex.org/W2064076655","https://openalex.org/W2067272684","https://openalex.org/W2073404525","https://openalex.org/W2086161653","https://openalex.org/W2089725613","https://openalex.org/W2095962350","https://openalex.org/W2117154949","https://openalex.org/W2122825543","https://openalex.org/W2125993116","https://openalex.org/W2135046866","https://openalex.org/W2142623206","https://openalex.org/W2146482778","https://openalex.org/W2162746441","https://openalex.org/W2166365115","https://openalex.org/W2167302917","https://openalex.org/W2168909589","https://openalex.org/W2169713291","https://openalex.org/W2311126677","https://openalex.org/W2949879541","https://openalex.org/W2951084471","https://openalex.org/W2969945254","https://openalex.org/W3096194929","https://openalex.org/W3100353959","https://openalex.org/W3141595720"],"related_works":["https://openalex.org/W4254717236","https://openalex.org/W2377757044","https://openalex.org/W3160952126","https://openalex.org/W2320103255","https://openalex.org/W798918733","https://openalex.org/W4213167601","https://openalex.org/W163279402","https://openalex.org/W2101287851","https://openalex.org/W2281909915","https://openalex.org/W2950466654"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,73],"present":[4],"a":[5,67],"generic":[6],"algorithmic":[7],"framework,":[8],"namely,":[9],"the":[10,26,41,85,90,101,104],"accelerated":[11],"stochastic":[12,20,28],"approximation":[13,29],"(AC-SA)":[14],"algorithm,":[15,43],"for":[16,34,59],"solving":[17,35,60],"strongly":[18,38],"convex":[19,39],"composite":[21],"optimization":[22],"(SCO)":[23],"problems.":[24],"While":[25],"classical":[27],"algorithms":[30,77],"are":[31],"asymptotically":[32],"optimal":[33,52,55],"differentiable":[36],"and":[37,93],"problems,":[40],"AC-SA":[42,76],"when":[44],"employed":[45],"with":[46,89],"proper":[47],"stepsize":[48],"policies,":[49],"can":[50],"achieve":[51],"or":[53],"nearly":[54],"rates":[56,92],"of":[57,63,70,103],"convergence":[58,91],"different":[61],"classes":[62],"SCO":[64],"problems":[65],"during":[66],"given":[68],"number":[69],"iterations.":[71],"Moreover,":[72],"investigate":[74],"these":[75],"in":[78],"more":[79],"detail,":[80],"such":[81],"as":[82],"by":[83],"establishing":[84],"large-deviation":[86],"results":[87],"associated":[88],"introducing":[94],"an":[95],"efficient":[96],"validation":[97],"procedure":[98],"to":[99],"check":[100],"accuracy":[102],"generated":[105],"solutions.":[106]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":13},{"year":2024,"cited_by_count":12},{"year":2023,"cited_by_count":23},{"year":2022,"cited_by_count":15},{"year":2021,"cited_by_count":36},{"year":2020,"cited_by_count":27},{"year":2019,"cited_by_count":39},{"year":2018,"cited_by_count":19},{"year":2017,"cited_by_count":15},{"year":2016,"cited_by_count":28},{"year":2015,"cited_by_count":16},{"year":2014,"cited_by_count":24},{"year":2013,"cited_by_count":14},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-03T22:45:19.894376","created_date":"2025-10-10T00:00:00"}