{"id":"https://openalex.org/W2726042758","doi":"https://doi.org/10.1109/lcsys.2017.2722406","title":"The Fastest Known Globally Convergent First-Order Method for Minimizing Strongly Convex Functions","display_name":"The Fastest Known Globally Convergent First-Order Method for Minimizing Strongly Convex Functions","publication_year":2017,"publication_date":"2017-07-03","ids":{"openalex":"https://openalex.org/W2726042758","doi":"https://doi.org/10.1109/lcsys.2017.2722406","mag":"2726042758"},"language":"en","primary_location":{"id":"doi:10.1109/lcsys.2017.2722406","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcsys.2017.2722406","pdf_url":null,"source":{"id":"https://openalex.org/S4306422535","display_name":"IEEE Control Systems Letters","issn_l":"2475-1456","issn":["2475-1456"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Control Systems Letters","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/A5035128434","display_name":"Bryan Van Scoy","orcid":"https://orcid.org/0000-0002-8286-2311"},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bryan Van Scoy","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA"],"raw_orcid":"https://orcid.org/0000-0002-8286-2311","affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA","institution_ids":["https://openalex.org/I111979921"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102856571","display_name":"Randy A. Freeman","orcid":"https://orcid.org/0000-0001-8998-3696"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Randy A. Freeman","raw_affiliation_strings":["Northwestern Institute on Complex Systems, Evanston, IL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northwestern Institute on Complex Systems, Evanston, IL, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101845066","display_name":"Kevin Lynch","orcid":"https://orcid.org/0000-0003-3833-6004"},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kevin M. Lynch","raw_affiliation_strings":["Department of Mechanical Engineering, Northwestern University, Evanston, IL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Northwestern University, Evanston, IL, USA","institution_ids":["https://openalex.org/I111979921"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.1814,"has_fulltext":false,"cited_by_count":130,"citation_normalized_percentile":{"value":0.98813178,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"2","issue":"1","first_page":"49","last_page":"54"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9993000030517578,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9958999752998352,"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/convex-function","display_name":"Convex function","score":0.6847859025001526},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.684196412563324},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.6766209602355957},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.6524332761764526},{"id":"https://openalex.org/keywords/lipschitz-continuity","display_name":"Lipschitz continuity","score":0.5856013298034668},{"id":"https://openalex.org/keywords/stochastic-gradient-descent","display_name":"Stochastic gradient descent","score":0.5605888366699219},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.535069465637207},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.5182292461395264},{"id":"https://openalex.org/keywords/ball","display_name":"Ball (mathematics)","score":0.49306508898735046},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.4916861653327942},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4797966778278351},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4562271237373352},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4214150905609131},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.41995131969451904},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4167347550392151},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.41269680857658386},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40814638137817383},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.22688016295433044},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20806795358657837},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08108460903167725}],"concepts":[{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.6847859025001526},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.684196412563324},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.6766209602355957},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.6524332761764526},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.5856013298034668},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.5605888366699219},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.535069465637207},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.5182292461395264},{"id":"https://openalex.org/C122041747","wikidata":"https://www.wikidata.org/wiki/Q838611","display_name":"Ball (mathematics)","level":2,"score":0.49306508898735046},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.4916861653327942},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4797966778278351},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4562271237373352},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4214150905609131},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.41995131969451904},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4167347550392151},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.41269680857658386},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40814638137817383},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.22688016295433044},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20806795358657837},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08108460903167725},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/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":1,"locations":[{"id":"doi:10.1109/lcsys.2017.2722406","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcsys.2017.2722406","pdf_url":null,"source":{"id":"https://openalex.org/S4306422535","display_name":"IEEE Control Systems Letters","issn_l":"2475-1456","issn":["2475-1456"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Control Systems Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8737782141","display_name":null,"funder_award_id":"N00014-16-1-2106","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1547678669","https://openalex.org/W1979896658","https://openalex.org/W1988720110","https://openalex.org/W2003658506","https://openalex.org/W2077418568","https://openalex.org/W2097460613","https://openalex.org/W2124541940","https://openalex.org/W2137731592","https://openalex.org/W2142338484","https://openalex.org/W2153749284","https://openalex.org/W2963152409","https://openalex.org/W2964093568","https://openalex.org/W2964102336","https://openalex.org/W3141595720","https://openalex.org/W4320931937","https://openalex.org/W6704564260"],"related_works":["https://openalex.org/W4206903459","https://openalex.org/W2754816816","https://openalex.org/W4366280654","https://openalex.org/W3160167280","https://openalex.org/W4231621013","https://openalex.org/W4362706668","https://openalex.org/W3008318776","https://openalex.org/W1977633006","https://openalex.org/W2041416246","https://openalex.org/W3020853991"],"abstract_inverted_index":{"We":[0,81],"design":[1,86],"and":[2,19,27,38,61,127],"analyze":[3],"a":[4,72,83],"novel":[5],"gradient-based":[6],"algorithm":[7,99],"for":[8,56,62,97],"unconstrained":[9],"convex":[10,18],"optimization.":[11],"When":[12],"the":[13,25,33,49,66,77,98,107,128],"objective":[14],"function":[15,28],"is":[16,22,70],"m-strongly":[17],"its":[20],"gradient":[21,121,125],"L-Lipschitz":[23],"continuous,":[24],"iterates":[26],"values":[29],"converge":[30],"linearly":[31],"to":[32,93],"optimum":[34],"at":[35],"rates":[36,55],"p":[37,42],"p2,":[39],"respectively,":[40],"where":[41],"=":[43],"1":[44],"-":[45],"\u221am/L.":[46],"These":[47],"are":[48],"fastest":[50],"known":[51],"guaranteed":[52],"linear":[53],"convergence":[54],"globally":[57],"convergent":[58],"first-order":[59],"methods,":[60],"high":[63],"desired":[64],"accuracies":[65],"corresponding":[67],"iteration":[68],"complexity":[69],"within":[71],"factor":[73],"of":[74,76,117],"two":[75],"theoretical":[78],"lower":[79],"bound.":[80],"use":[82],"simple":[84],"graphical":[85],"procedure":[87],"based":[88],"on":[89],"integral":[90],"quadratic":[91],"constraints":[92],"derive":[94],"closed-form":[95],"expressions":[96],"parameters.":[100],"The":[101],"new":[102],"algorithm,":[103],"which":[104],"we":[105],"call":[106],"triple":[108],"momentum":[109],"method,":[110],"can":[111],"be":[112],"seen":[113],"as":[114,120],"an":[115],"extension":[116],"methods":[118],"such":[119],"descent,":[122,126],"Nesterov's":[123],"accelerated":[124],"heavy-ball":[129],"method.":[130]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":15},{"year":2024,"cited_by_count":21},{"year":2023,"cited_by_count":12},{"year":2022,"cited_by_count":18},{"year":2021,"cited_by_count":20},{"year":2020,"cited_by_count":20},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":1}],"updated_date":"2026-08-08T07:41:36.138363","created_date":"2025-10-10T00:00:00"}