{"id":"https://openalex.org/W3037153379","doi":"https://doi.org/10.1137/19m1281368","title":"Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation","display_name":"Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3037153379","doi":"https://doi.org/10.1137/19m1281368","mag":"3037153379"},"language":"en","primary_location":{"id":"doi:10.1137/19m1281368","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1281368","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":true,"oa_status":"green","oa_url":"http://hdl.handle.net/2078.1/232178","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019341464","display_name":"Etienne de Klerk","orcid":"https://orcid.org/0000-0003-3377-0063"},"institutions":[{"id":"https://openalex.org/I193700539","display_name":"Tilburg University","ror":"https://ror.org/04b8v1s79","country_code":"NL","type":"education","lineage":["https://openalex.org/I193700539"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Etienne De Klerk","raw_affiliation_strings":["Tilburg University - Department of Econometrics and Operations Research (Tilburg University Warandelaan 2 5037 AB Tilburg Phone +31 (0)13 466 9111 E-mail: info@tilburguniversity.edu - Netherlands)"],"affiliations":[{"raw_affiliation_string":"Tilburg University - Department of Econometrics and Operations Research (Tilburg University Warandelaan 2 5037 AB Tilburg Phone +31 (0)13 466 9111 E-mail: info@tilburguniversity.edu - Netherlands)","institution_ids":["https://openalex.org/I193700539"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038754080","display_name":"Fran\u00e7ois Glineur","orcid":"https://orcid.org/0000-0002-5890-1093"},"institutions":[{"id":"https://openalex.org/I95674353","display_name":"UCLouvain","ror":"https://ror.org/02495e989","country_code":"BE","type":"education","lineage":["https://openalex.org/I95674353"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Fran\u00e7ois Glineur","raw_affiliation_strings":["UCL - Universit\u00e9 Catholique de Louvain = Catholic University of Louvain (Place de l'Universit\u00e9 1 - 1348 Louvain-La-Neuve - Belgium)"],"affiliations":[{"raw_affiliation_string":"UCL - Universit\u00e9 Catholique de Louvain = Catholic University of Louvain (Place de l'Universit\u00e9 1 - 1348 Louvain-La-Neuve - Belgium)","institution_ids":["https://openalex.org/I95674353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016176008","display_name":"Adrien Taylor","orcid":"https://orcid.org/0000-0003-2509-1765"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Adrien B. Taylor","raw_affiliation_strings":["SIERRA - Statistical Machine Learning and Parsimony (France)"],"affiliations":[{"raw_affiliation_string":"SIERRA - Statistical Machine Learning and Parsimony (France)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5019341464"],"corresponding_institution_ids":["https://openalex.org/I193700539"],"apc_list":null,"apc_paid":null,"fwci":4.133,"has_fulltext":true,"cited_by_count":31,"citation_normalized_percentile":{"value":0.95240519,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"30","issue":"3","first_page":"2053","last_page":"2082"},"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/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.9998000264167786,"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/semidefinite-programming","display_name":"Semidefinite programming","score":0.7781436443328857},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.7036908864974976},{"id":"https://openalex.org/keywords/newtons-method","display_name":"Newton's method","score":0.5996719598770142},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5661185383796692},{"id":"https://openalex.org/keywords/estimation","display_name":"Estimation","score":0.502488374710083},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46723371744155884},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.4593297839164734},{"id":"https://openalex.org/keywords/semidefinite-embedding","display_name":"Semidefinite embedding","score":0.4433537721633911},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.432148814201355},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.13712546229362488},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.0763654112815857},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.07053285837173462},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.07041570544242859},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.053142040967941284}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.7781436443328857},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.7036908864974976},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.5996719598770142},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5661185383796692},{"id":"https://openalex.org/C96250715","wikidata":"https://www.wikidata.org/wiki/Q965330","display_name":"Estimation","level":2,"score":0.502488374710083},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46723371744155884},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4593297839164734},{"id":"https://openalex.org/C206818286","wikidata":"https://www.wikidata.org/wiki/Q7449403","display_name":"Semidefinite embedding","level":4,"score":0.4433537721633911},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.432148814201355},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.13712546229362488},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0763654112815857},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.07053285837173462},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.07041570544242859},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.053142040967941284},{"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/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/19m1281368","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1281368","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:tilburguniversity.edu:publications/03a65c83-e88f-4723-a50e-287f7820dcbe","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401490","display_name":"Research portal (Tilburg University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193700539","host_organization_name":"Tilburg University","host_organization_lineage":["https://openalex.org/I193700539"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:HAL:hal-02956367v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-02956367","pdf_url":null,"source":{"id":"https://openalex.org/S4406922466","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Optimization, 2020, 30 (3), pp.2053-2082. ⟨10.1137/19M1281368⟩","raw_type":"Journal articles"},{"id":"pmh:oai:dial.uclouvain.be:boreal:232178","is_oa":true,"landing_page_url":"http://hdl.handle.net/2078.1/232178","pdf_url":null,"source":{"id":"https://openalex.org/S4306401902","display_name":"Digital Access to Libraries (Universit\u00e9 catholique de Louvain (UCL), l'Universit\u00e9 de Namur (UNamur) and the Universit\u00e9 Saint-Louis (USL-B))","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I95674353","host_organization_name":"UCLouvain","host_organization_lineage":["https://openalex.org/I95674353"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Optimization, Vol. 30, no.3, p. 2053-2082 (2020)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:dial.uclouvain.be:boreal:232178","is_oa":true,"landing_page_url":"http://hdl.handle.net/2078.1/232178","pdf_url":null,"source":{"id":"https://openalex.org/S4306401902","display_name":"Digital Access to Libraries (Universit\u00e9 catholique de Louvain (UCL), l'Universit\u00e9 de Namur (UNamur) and the Universit\u00e9 Saint-Louis (USL-B))","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I95674353","host_organization_name":"UCLouvain","host_organization_lineage":["https://openalex.org/I95674353"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Optimization, Vol. 30, no.3, p. 2053-2082 (2020)","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1142898455","display_name":null,"funder_award_id":"724063","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"}],"funders":[{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1547678669","https://openalex.org/W1931370844","https://openalex.org/W1962121538","https://openalex.org/W1979896658","https://openalex.org/W2027445028","https://openalex.org/W2051764203","https://openalex.org/W2097460613","https://openalex.org/W2121210949","https://openalex.org/W2124768887","https://openalex.org/W2125299871","https://openalex.org/W2168908795","https://openalex.org/W2473376220","https://openalex.org/W2558210108","https://openalex.org/W2615571142","https://openalex.org/W2726042758","https://openalex.org/W2951335402","https://openalex.org/W2963797349","https://openalex.org/W2964102336","https://openalex.org/W3104749043","https://openalex.org/W4252213128"],"related_works":["https://openalex.org/W2385886188","https://openalex.org/W2288891047","https://openalex.org/W2524928742","https://openalex.org/W2362452378","https://openalex.org/W2353517195","https://openalex.org/W3166939022","https://openalex.org/W1727084346","https://openalex.org/W2544939111","https://openalex.org/W2386048074","https://openalex.org/W2572095861"],"abstract_inverted_index":{"We":[0],"provide":[1],"new":[2],"tools":[3],"for":[4,17,25,61],"worst-case":[5,112],"performance":[6,40,58],"analysis":[7,36,88,114],"of":[8,15,31,64,80,89,115],"the":[9,29,62,67,78,81],"gradient":[10],"(or":[11],"steepest":[12],"descent)":[13],"method":[14,24,63,120],"Cauchy":[16,65],"smooth":[18],"strongly":[19],"convex":[20],"functions,":[21,27],"and":[22,46,55,123],"Newton's":[23],"self-concordant":[26],"including":[28],"case":[30],"inexact":[32,96],"search":[33,97],"directions.":[34,98],"The":[35],"uses":[37],"semidefinite":[38],"programming":[39],"estimation,":[41],"as":[42],"pioneered":[43],"by":[44,66,121],"Drori":[45],"Teboulle":[47],"[it":[48,69,125],"Math.":[49],"Program.,":[50],"145":[51],"(2014),":[52],"pp.":[53,74,129],"451--482],":[54],"extends":[56],"recent":[57,117],"estimation":[59],"results":[60],"authors":[68],"Optim.":[70],"Lett.,":[71],"11":[72],"(2017),":[73],"1185--1199].":[75],"To":[76],"illustrate":[77],"applicability":[79],"tools,":[82],"we":[83,105],"demonstrate":[84],"a":[85,110,116],"novel":[86],"complexity":[87,113],"short":[90],"step":[91],"interior":[92,118],"point":[93,119],"methods":[94],"using":[95],"As":[99],"an":[100],"example":[101],"in":[102],"this":[103],"framework,":[104],"sketch":[106],"how":[107],"to":[108],"give":[109],"rigorous":[111],"Abernethy":[122],"Hazan":[124],"PMLR,":[126],"48":[127],"(2016),":[128],"2520--2528].":[130]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":11},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":9}],"updated_date":"2026-04-12T07:58:50.170612","created_date":"2025-10-10T00:00:00"}