{"id":"https://openalex.org/W2473376220","doi":"https://doi.org/10.1007/s11590-016-1087-4","title":"On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions","display_name":"On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions","publication_year":2016,"publication_date":"2016-10-14","ids":{"openalex":"https://openalex.org/W2473376220","doi":"https://doi.org/10.1007/s11590-016-1087-4","mag":"2473376220"},"language":"en","primary_location":{"id":"doi:10.1007/s11590-016-1087-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11590-016-1087-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11590-016-1087-4.pdf","source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s11590-016-1087-4.pdf","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"]},{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Etienne de Klerk","raw_affiliation_strings":["Delft University of Technology, Delft, The Netherlands","Tilburg University, Tilburg, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Delft University of Technology, Delft, The Netherlands","institution_ids":["https://openalex.org/I98358874"]},{"raw_affiliation_string":"Tilburg University, Tilburg, The 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/CORE and ICTEAM, Louvain-la-Neuve, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UCL/CORE and ICTEAM, 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":[{"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":"Adrien B. Taylor","raw_affiliation_strings":["UCL/CORE and ICTEAM, Louvain-la-Neuve, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UCL/CORE and ICTEAM, Louvain-la-Neuve, Belgium","institution_ids":["https://openalex.org/I95674353"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5019341464"],"corresponding_institution_ids":["https://openalex.org/I193700539","https://openalex.org/I98358874"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":6.4951,"has_fulltext":true,"cited_by_count":62,"citation_normalized_percentile":{"value":0.96684559,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":"11","issue":"7","first_page":"1185","last_page":"1199"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9994000196456909,"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.9994000196456909,"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.9987000226974487,"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.9986000061035156,"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/line-search","display_name":"Line search","score":0.8680353760719299},{"id":"https://openalex.org/keywords/lipschitz-continuity","display_name":"Lipschitz continuity","score":0.7100890874862671},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.6901684999465942},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6846617460250854},{"id":"https://openalex.org/keywords/proximal-gradient-methods","display_name":"Proximal Gradient Methods","score":0.5842380523681641},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.510134756565094},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.5084902048110962},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.5001614093780518},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.4985795021057129},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4862571954727173},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4673821032047272},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.46635594964027405},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4581529200077057},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.4510766565799713},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.45029234886169434},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.42219680547714233},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.417500376701355},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17913010716438293},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.15806886553764343},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06620559096336365},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.06411466002464294}],"concepts":[{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.8680353760719299},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.7100890874862671},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.6901684999465942},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6846617460250854},{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.5842380523681641},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.510134756565094},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5084902048110962},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.5001614093780518},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.4985795021057129},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4862571954727173},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4673821032047272},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.46635594964027405},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4581529200077057},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.4510766565799713},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.45029234886169434},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.42219680547714233},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.417500376701355},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17913010716438293},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.15806886553764343},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06620559096336365},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.06411466002464294},{"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},{"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/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s11590-016-1087-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11590-016-1087-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11590-016-1087-4.pdf","source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Letters","raw_type":"journal-article"},{"id":"pmh:uvt:oai:tilburguniversity.edu:publications/8cc0e8dd-b6cd-4f4f-9dcb-9531d5df7a75","is_oa":true,"landing_page_url":"https://research.tilburguniversity.edu/en/publications/8cc0e8dd-b6cd-4f4f-9dcb-9531d5df7a75","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"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":"Optimization Letters, 11(7). Springer Verlag","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:dial.uclouvain.be:boreal:180605","is_oa":false,"landing_page_url":"http://hdl.handle.net/2078.1/180605","pdf_url":null,"source":{"id":"https://openalex.org/S4306400166","display_name":"Digital Access to Libraries","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800384882","host_organization_name":"Harris County Public Library","host_organization_lineage":["https://openalex.org/I2800384882"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Optimization Letters, Vol. 11, no. 7, p. 1185-1199 (2017)","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:tilburguniversity.edu:publications/8cc0e8dd-b6cd-4f4f-9dcb-9531d5df7a75","is_oa":true,"landing_page_url":"http://rdcu.be/ldxh","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"de Klerk, E, Glineur, F & Taylor, A 2017, 'On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions', Optimization Letters, vol. 11, no. 7, pp. 1185\u20131199. https://doi.org/10.1007/s11590-016-1087-4","raw_type":"article"},{"id":"pmh:oai:tudelft.nl:uuid:b3ecfccf-5481-4660-ba40-d7d477ae2779","is_oa":false,"landing_page_url":"http://resolver.tudelft.nl/uuid:b3ecfccf-5481-4660-ba40-d7d477ae2779","pdf_url":null,"source":{"id":"https://openalex.org/S4306400906","display_name":"Research Repository (Delft University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98358874","host_organization_name":"Delft University of Technology","host_organization_lineage":["https://openalex.org/I98358874"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"journal article"}],"best_oa_location":{"id":"doi:10.1007/s11590-016-1087-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11590-016-1087-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11590-016-1087-4.pdf","source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Letters","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6865953765","display_name":null,"funder_award_id":"13/18-054","funder_id":"https://openalex.org/F4320321584","funder_display_name":"F\u00e9d\u00e9ration Wallonie-Bruxelles"}],"funders":[{"id":"https://openalex.org/F4320321390","display_name":"Fonds De La Recherche Scientifique - FNRS","ror":"https://ror.org/03q83t159"},{"id":"https://openalex.org/F4320321584","display_name":"F\u00e9d\u00e9ration Wallonie-Bruxelles","ror":"https://ror.org/04q01pf08"},{"id":"https://openalex.org/F4320324594","display_name":"Universiteit van Tilburg","ror":"https://ror.org/04b8v1s79"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2473376220.pdf","grobid_xml":"https://content.openalex.org/works/W2473376220.grobid-xml"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W1568288633","https://openalex.org/W1573250193","https://openalex.org/W1962121538","https://openalex.org/W1979896658","https://openalex.org/W2124541940","https://openalex.org/W2263490141","https://openalex.org/W2951335402","https://openalex.org/W4291236916","https://openalex.org/W6600553700"],"related_works":["https://openalex.org/W2352839224","https://openalex.org/W2371590971","https://openalex.org/W3194213170","https://openalex.org/W2372778757","https://openalex.org/W2048029112","https://openalex.org/W1973734200","https://openalex.org/W4293100925","https://openalex.org/W2959146022","https://openalex.org/W2364380736","https://openalex.org/W2359354137"],"abstract_inverted_index":{"We":[0,22,47],"consider":[1],"the":[2,24,50,91,102],"gradient":[3,60,76],"(or":[4],"steepest)":[5],"descent":[6,61],"method":[7],"with":[8,18],"exact":[9,25,64],"line":[10],"search":[11,70],"applied":[12],"to":[13],"a":[14,42,56,69,80],"strongly":[15],"convex":[16,44],"function":[17],"Lipschitz":[19],"continuous":[20],"gradient.":[21],"establish":[23],"worst-case":[26,37,52],"rate":[27],"of":[28,30,59,93],"convergence":[29],"this":[31,36],"scheme,":[32],"and":[33,88,105],"show":[34],"that":[35,72],"behavior":[38],"is":[39,66],"exhibited":[40],"by":[41,77],"certain":[43],"quadratic":[45],"function.":[46],"also":[48],"give":[49],"tight":[51],"complexity":[53],"bound":[54],"for":[55],"noisy":[57],"variant":[58],"method,":[62],"where":[63],"line-search":[65],"performed":[67],"in":[68,101],"direction":[71],"differs":[73],"from":[74],"negative":[75],"at":[78],"most":[79],"prescribed":[81],"relative":[82],"tolerance.":[83],"The":[84],"proofs":[85],"are":[86],"computer-assisted,":[87],"rely":[89],"on":[90],"resolutions":[92],"semidefinite":[94],"programming":[95],"performance":[96],"estimation":[97],"problems":[98],"as":[99],"introduced":[100],"paper":[103],"(Drori":[104],"Teboulle,":[106],"Math":[107],"Progr":[108],"145(1\u20132):451\u2013482,":[109],"2014).":[110]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":5}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}