{"id":"https://openalex.org/W2963688849","doi":"https://doi.org/10.1109/isit.2018.8437794","title":"An Explicit Convergence Rate for Nesterov's Method from SDP","display_name":"An Explicit Convergence Rate for Nesterov's Method from SDP","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2963688849","doi":"https://doi.org/10.1109/isit.2018.8437794","mag":"2963688849"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2018.8437794","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437794","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-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/A5058763411","display_name":"Sam Safavi","orcid":"https://orcid.org/0000-0001-7119-4429"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sam Safavi","raw_affiliation_strings":["Department of EE, Princeton University, Princeton, NJ"],"affiliations":[{"raw_affiliation_string":"Department of EE, Princeton University, Princeton, NJ","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034137642","display_name":"Bikash Joshi","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bikash Joshi","raw_affiliation_strings":["Dept. of ECE and ISR, University of Maryland, MD"],"affiliations":[{"raw_affiliation_string":"Dept. of ECE and ISR, University of Maryland, MD","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079880652","display_name":"Guilherme Fran\u00e7a","orcid":"https://orcid.org/0000-0003-3424-273X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guilherme Fran\u00e7a","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5089281038","display_name":"Jos\u00e9 Bento","orcid":"https://orcid.org/0000-0003-1835-1530"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jos\u00e9 Bento","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5058763411"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":1.2161,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.77827739,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1560","last_page":"1564"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":1.0,"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":1.0,"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.9998000264167786,"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"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9997000098228455,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.7996937036514282},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6511430144309998},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.626642644405365},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6247627139091492},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.6010175943374634},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.5125489234924316},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.49000683426856995},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.4805065393447876},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.47459858655929565},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44999492168426514},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.44890090823173523},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.4462227523326874},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.40112823247909546},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2631933093070984},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23070743680000305},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1183612048625946},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.04718983173370361}],"concepts":[{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.7996937036514282},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6511430144309998},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.626642644405365},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6247627139091492},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.6010175943374634},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.5125489234924316},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.49000683426856995},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.4805065393447876},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.47459858655929565},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44999492168426514},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.44890090823173523},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.4462227523326874},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.40112823247909546},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2631933093070984},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23070743680000305},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1183612048625946},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.04718983173370361},{"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},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2018.8437794","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437794","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332161","display_name":"National Institutes of Health","ror":"https://ror.org/01cwqze88"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W104184427","https://openalex.org/W1487444668","https://openalex.org/W1542938076","https://openalex.org/W1860742233","https://openalex.org/W1946256299","https://openalex.org/W2023722580","https://openalex.org/W2055576996","https://openalex.org/W2100556411","https://openalex.org/W2141116650","https://openalex.org/W2153749284","https://openalex.org/W2167732364","https://openalex.org/W2194067778","https://openalex.org/W2520966671","https://openalex.org/W2528062157","https://openalex.org/W2951248065","https://openalex.org/W2964102336","https://openalex.org/W3099531832","https://openalex.org/W3124114587","https://openalex.org/W3141595720","https://openalex.org/W4297688356","https://openalex.org/W4301621763","https://openalex.org/W6604254268","https://openalex.org/W6640831999","https://openalex.org/W6727162712","https://openalex.org/W6727883105"],"related_works":["https://openalex.org/W2352839224","https://openalex.org/W2371590971","https://openalex.org/W2203098598","https://openalex.org/W1653317167","https://openalex.org/W2952690984","https://openalex.org/W4312206320","https://openalex.org/W2024017812","https://openalex.org/W4384575246","https://openalex.org/W2160052563","https://openalex.org/W2115832833"],"abstract_inverted_index":{"The":[0],"framework":[1],"of":[2,16,23,59,111,123,138],"Integral":[3],"Quadratic":[4],"Constraints":[5],"(IQC)":[6],"introduced":[7],"by":[8],"Lessard":[9],"et":[10],"al.":[11],"(2014)":[12],"reduces":[13],"the":[14,20,56,85,108,121,128,135],"computation":[15],"upper":[17,105,132],"bounds":[18,75],"on":[19,55,107,134],"convergence":[21,57,109,136],"rate":[22,58,110,137],"several":[24],"optimization":[25],"algorithms":[26],"to":[27,37,51,84],"semi-definite":[28],"programming":[29],"(SDP).":[30],"In":[31,90],"particular,":[32],"this":[33,45,91,126],"technique":[34],"was":[35,47,68,87],"applied":[36],"Nesterov's":[38],"accelerated":[39],"method":[40],"(NAM).":[41],"For":[42],"quadratic":[43],"functions,":[44],"SDP":[46,86],"explicitly":[48],"solved":[49],"leading":[50],"a":[52,100],"new":[53,101],"bound":[54,106,133],"NAM,":[60,112],"and":[61,103,130],"for":[62,140],"arbitrary":[63],"strongly":[64,141],"convex":[65,142],"functions":[66],"it":[67],"shown":[69],"numerically":[70],"that":[71],"IQC":[72],"can":[73],"improve":[74],"from":[76],"Nesterov":[77],"(2004).":[78],"Unfortunately,":[79],"an":[80,96],"explicit":[81,104],"analytic":[82],"solution":[83],"not":[88],"provided.":[89],"paper,":[92],"we":[93,114],"provide":[94],"such":[95],"analytical":[97],"solution,":[98],"obtaining":[99],"general":[102],"which":[113],"further":[115],"optimize":[116],"over":[117],"its":[118],"parameters.":[119],"To":[120],"best":[122],"our":[124],"knowledge,":[125],"is":[127],"best,":[129],"explicit,":[131],"NAM":[139],"functions.":[143]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}