{"id":"https://openalex.org/W2168909589","doi":"https://doi.org/10.1137/110848876","title":"Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization, II: Shrinking Procedures and Optimal Algorithms","display_name":"Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization, II: Shrinking Procedures and Optimal Algorithms","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2168909589","doi":"https://doi.org/10.1137/110848876","mag":"2168909589"},"language":"en","primary_location":{"id":"doi:10.1137/110848876","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110848876","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":24.2249,"has_fulltext":false,"cited_by_count":187,"citation_normalized_percentile":{"value":0.99531078,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"23","issue":"4","first_page":"2061","last_page":"2089"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":1.0,"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":1.0,"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.9962999820709229,"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/algorithm","display_name":"Algorithm","score":0.7540473937988281},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6940131187438965},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5995771884918213},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5768730044364929},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5556991696357727},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5048125982284546},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.46732914447784424},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.42902377247810364},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.4260748624801636},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4188888967037201},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22554287314414978},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.06319805979728699}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7540473937988281},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6940131187438965},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5995771884918213},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5768730044364929},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5556991696357727},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5048125982284546},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.46732914447784424},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.42902377247810364},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.4260748624801636},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4188888967037201},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22554287314414978},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.06319805979728699},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/110848876","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110848876","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.414.1404","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.414.1404","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.optimization-online.org/DB_FILE/2010/07/2669.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W203276351","https://openalex.org/W1490324987","https://openalex.org/W1499021337","https://openalex.org/W1505731132","https://openalex.org/W1556545893","https://openalex.org/W1575259140","https://openalex.org/W1852945463","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/W2005369372","https://openalex.org/W2020929673","https://openalex.org/W2024484010","https://openalex.org/W2045744861","https://openalex.org/W2048923650","https://openalex.org/W2064076655","https://openalex.org/W2086161653","https://openalex.org/W2095962350","https://openalex.org/W2096199223","https://openalex.org/W2135499062","https://openalex.org/W2167302917","https://openalex.org/W2311126677","https://openalex.org/W2335975441","https://openalex.org/W2597289420","https://openalex.org/W2969945254","https://openalex.org/W3141595720"],"related_works":["https://openalex.org/W2811008754","https://openalex.org/W2953109382","https://openalex.org/W4298668733","https://openalex.org/W2952048857","https://openalex.org/W2403913678","https://openalex.org/W3047780503","https://openalex.org/W2554066544","https://openalex.org/W2962945188","https://openalex.org/W2963787226","https://openalex.org/W2604718646"],"abstract_inverted_index":{"In":[0],"this":[1,112],"paper":[2],"we":[3,32,63],"study":[4],"new":[5],"stochastic":[6,20],"approximation":[7],"(SA)":[8],"type":[9,145],"algorithms,":[10],"namely,":[11],"the":[12,35,40,85,90,101,107,114,126,138],"accelerated":[13],"SA":[14,140,144],"(AC-SA),":[15],"for":[16,76,147],"solving":[17,77,148],"strongly":[18,78,152],"convex":[19,79,153],"composite":[21],"optimization":[22],"(SCO)":[23],"problems.":[24,155],"Specifically,":[25],"by":[26,50],"introducing":[27],"a":[28,44,65,95],"domain":[29],"shrinking":[30],"procedure,":[31],"significantly":[33],"improve":[34],"large-deviation":[36],"results":[37],"associated":[38],"with":[39],"convergence":[41,75],"rate":[42,73],"of":[43,74,84,97,103,109,151],"nearly":[45],"optimal":[46,72,120],"AC-SA":[47,67,133],"algorithm":[48],"presented":[49,124],"Ghadimi":[51],"and":[52,100,141],"Lan":[53],"in":[54,82,125],"[SIAM":[55],"J.":[56],"Optim.,":[57],"22":[58],"(2012),":[59],"pp":[60],"1469--1492].":[61],"Moreover,":[62],"introduce":[64],"multistage":[66],"algorithm,":[68],"which":[69],"possesses":[70],"an":[71,119],"SCO":[80,154],"problems":[81],"terms":[83],"dependence":[86],"on":[87],"not":[88],"only":[89],"target":[91],"accuracy,":[92],"but":[93],"also":[94],"number":[96],"problem":[98],"parameters":[99],"selection":[102],"initial":[104],"points.":[105],"To":[106],"best":[108],"our":[110,129],"knowledge,":[111],"is":[113],"first":[115],"time":[116],"that":[117],"such":[118],"method":[121],"has":[122],"been":[123],"literature.":[127],"From":[128],"computational":[130],"results,":[131],"these":[132],"algorithms":[134,146],"can":[135],"substantially":[136],"outperform":[137],"classical":[139],"some":[142],"other":[143],"certain":[149],"classes":[150]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":12},{"year":2023,"cited_by_count":12},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":21},{"year":2020,"cited_by_count":21},{"year":2019,"cited_by_count":24},{"year":2018,"cited_by_count":16},{"year":2017,"cited_by_count":15},{"year":2016,"cited_by_count":17},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}