{"id":"https://openalex.org/W1835842564","doi":"https://doi.org/10.1137/17m1147846","title":"Convergence Rate of Incremental Gradient and Incremental Newton Methods","display_name":"Convergence Rate of Incremental Gradient and Incremental Newton Methods","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W1835842564","doi":"https://doi.org/10.1137/17m1147846","mag":"1835842564"},"language":"en","primary_location":{"id":"doi:10.1137/17m1147846","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1147846","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1510.08562","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"M. G\u00fcrb\u00fczbalaban","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. G\u00fcrb\u00fczbalaban","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"A. Ozdaglar","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A. Ozdaglar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"P. A. Parrilo","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"P. A. Parrilo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.723,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.77584134,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"29","issue":"4","first_page":"2542","last_page":"2565"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9850000143051147,"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.9850000143051147,"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.004999999888241291,"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.004100000020116568,"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/iterated-function","display_name":"Iterated function","score":0.6870999932289124},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.6743000149726868},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.6399999856948853},{"id":"https://openalex.org/keywords/proximal-gradient-methods","display_name":"Proximal Gradient Methods","score":0.6152999997138977},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.6141999959945679},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.5860000252723694},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.49470001459121704},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.48429998755455017},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.47290000319480896}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8051999807357788},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.6870999932289124},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.6743000149726868},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.6399999856948853},{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.6152999997138977},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.6141999959945679},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5860000252723694},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.5194000005722046},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.49470001459121704},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.48429998755455017},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.47290000319480896},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46889999508857727},{"id":"https://openalex.org/C161999928","wikidata":"https://www.wikidata.org/wiki/Q4556320","display_name":"Variational inequality","level":2,"score":0.46540001034736633},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.46129998564720154},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4244999885559082},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4056999981403351},{"id":"https://openalex.org/C179127668","wikidata":"https://www.wikidata.org/wiki/Q17086396","display_name":"Newton's method in optimization","level":4,"score":0.4034999907016754},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3930000066757202},{"id":"https://openalex.org/C114954040","wikidata":"https://www.wikidata.org/wiki/Q1476018","display_name":"Quasi-Newton method","level":4,"score":0.3871999979019165},{"id":"https://openalex.org/C149073432","wikidata":"https://www.wikidata.org/wiki/Q4960382","display_name":"Bregman divergence","level":2,"score":0.32910001277923584},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.32190001010894775},{"id":"https://openalex.org/C122268817","wikidata":"https://www.wikidata.org/wiki/Q2020318","display_name":"Frank\u2013Wolfe algorithm","level":5,"score":0.3181000053882599},{"id":"https://openalex.org/C79248915","wikidata":"https://www.wikidata.org/wiki/Q17086776","display_name":"Proximal gradient methods for learning","level":5,"score":0.3174000084400177},{"id":"https://openalex.org/C195065555","wikidata":"https://www.wikidata.org/wiki/Q214881","display_name":"Curvature","level":2,"score":0.310699999332428},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.30059999227523804},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.28299999237060547},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28200000524520874},{"id":"https://openalex.org/C26362088","wikidata":"https://www.wikidata.org/wiki/Q17086453","display_name":"Nonlinear conjugate gradient method","level":4,"score":0.27649998664855957},{"id":"https://openalex.org/C15964574","wikidata":"https://www.wikidata.org/wiki/Q7295534","display_name":"Rate function","level":3,"score":0.2572000026702881},{"id":"https://openalex.org/C173278390","wikidata":"https://www.wikidata.org/wiki/Q3075191","display_name":"Support function","level":5,"score":0.2538999915122986}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/17m1147846","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1147846","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:arXiv.org:1510.08562","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1510.08562","pdf_url":"https://arxiv.org/pdf/1510.08562","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1510.08562","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1510.08562","pdf_url":"https://arxiv.org/pdf/1510.08562","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1562505150","https://openalex.org/W1571416372","https://openalex.org/W1970997001","https://openalex.org/W1971942712","https://openalex.org/W1972711404","https://openalex.org/W1983933235","https://openalex.org/W1986868156","https://openalex.org/W1988795359","https://openalex.org/W1992208280","https://openalex.org/W2010315937","https://openalex.org/W2030918292","https://openalex.org/W2036256495","https://openalex.org/W2044212084","https://openalex.org/W2057366835","https://openalex.org/W2061863621","https://openalex.org/W2070986426","https://openalex.org/W2076428552","https://openalex.org/W2086161653","https://openalex.org/W2095531095","https://openalex.org/W2101159990","https://openalex.org/W2105767123","https://openalex.org/W2113372738","https://openalex.org/W2129160848","https://openalex.org/W2141648331","https://openalex.org/W2221583060","https://openalex.org/W2276974598","https://openalex.org/W2953690514","https://openalex.org/W4240558668","https://openalex.org/W4292363360"],"related_works":[],"abstract_inverted_index":{"The":[0,52,224],"incremental":[1,53,102,105,219],"gradient":[2,50,103,235,239,246],"(IG)":[3],"method":[4,38,221,232,237],"is":[5,19,35,60,91],"a":[6,11,36,45,61,115,143,149,196,204,210,234],"prominent":[7],"algorithm":[8],"for":[9,100,170,244],"minimizing":[10],"finite":[12],"sum":[13],"of":[14,70,133,155,212,254,288,294],"smooth":[15],"convex":[16,93],"functions":[17,42,73,174,183],"and":[18,29,74,94,104,110,126,262],"used":[20],"in":[21,152,167,292,297],"many":[22],"contexts":[23],"including":[24],"large-scale":[25],"data":[26],"processing":[27],"applications":[28],"distributed":[30],"optimization":[31],"over":[32],"networks.":[33],"It":[34],"first-order":[37],"that":[39,130,181,188,251],"processes":[40],"the":[41,57,67,71,85,88,101,131,134,138,153,156,163,171,178,182,191,213,218,230,245,255,259,268],"one":[43],"at":[44,142],"time":[46],"based":[47,227],"on":[48,56,84,228],"their":[49,277,295],"information.":[51],"Newton":[54,106,220],"method,":[55],"other":[58],"hand,":[59],"second-order":[62],"variant":[63],"which":[64],"additionally":[65],"exploits":[66],"curvature":[68],"information":[69],"underlying":[72],"can":[75],"therefore":[76],"be":[77,209],"faster.":[78],"In":[79,280],"this":[80,161],"paper,":[81],"we":[82,128,282],"focus":[83],"case":[86,172],"when":[87,173],"objective":[89,157],"function":[90,211],"strongly":[92],"present":[95],"new":[96],"convergence":[97],"rate":[98,144,151,194,290],"estimates":[99],"methods":[107],"under":[108,177],"constant":[109,216],"diminishing":[111],"step":[112,197],"sizes.":[113],"For":[114,159],"decaying":[116],"step-size":[117,205],"rule":[118],"$\\alpha_k":[119,199],"=":[120,200],"R/k^s$":[121],"with":[122,195,238],"$s":[123],"\\in":[124],"(0,1]$":[125],"$R>0$,":[127],"show":[129,187,286],"distance":[132],"IG":[135,202,231],"iterates":[136,257],"to":[137,189,208,248,258,272,275,285],"optimal":[139,260],"solution":[140,261],"converges":[141],"$\\mathcal{O}(1/k^{s})$":[145],"(which":[146],"translates":[147],"into":[148],"$\\mathcal{O}(1/k^{2s})$":[150],"suboptimality":[154],"value).":[158],"$s>1/2$,":[160],"improves":[162],"previous":[164],"$\\mathcal{O}(1/\\sqrt{k})$":[165],"results":[166,225,291],"distances":[168,253],"obtained":[169],"are":[175,184,226],"nonsmooth":[176],"additional":[179],"assumption":[180],"smooth.":[185],"We":[186],"achieve":[190],"fastest":[192],"$\\mathcal{O}(1/k)$":[193],"size":[198],"R/k$,":[201],"needs":[203],"parameter":[206],"$R$":[207],"strong":[214],"convexity":[215],"whereas":[217],"does":[222],"not.":[223],"viewing":[229],"as":[233],"descent":[236],"errors,":[240],"developing":[241],"upper":[242],"bounds":[243],"error":[247],"derive":[249],"inequalities":[250,274],"relate":[252],"consecutive":[256],"finally":[263],"applying":[264],"Chung's":[265],"lemmas":[266],"from":[267],"stochastic":[269],"approximation":[270],"literature":[271],"these":[273],"determine":[276],"asymptotic":[278],"behavior.":[279],"addition,":[281],"construct":[283],"examples":[284],"tightness":[287],"our":[289],"terms":[293],"dependency":[296],"$k$.":[298]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2016-06-24T00:00:00"}