{"id":"https://openalex.org/W4375860026","doi":"https://doi.org/10.1137/21m1390037","title":"Nesterov's Method for Convex Optimization","display_name":"Nesterov's Method for Convex Optimization","publication_year":2023,"publication_date":"2023-05-01","ids":{"openalex":"https://openalex.org/W4375860026","doi":"https://doi.org/10.1137/21m1390037"},"language":"en","primary_location":{"id":"doi:10.1137/21m1390037","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21m1390037","pdf_url":null,"source":{"id":"https://openalex.org/S160107561","display_name":"SIAM Review","issn_l":"0036-1445","issn":["0036-1445","1095-7200"],"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 Review","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/A5042222077","display_name":"Noel J. Walkington","orcid":"https://orcid.org/0000-0002-9128-0524"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Noel J. Walkington","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5042222077"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.3127,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.97074695,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":"65","issue":"2","first_page":"539","last_page":"562"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9993000030517578,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9945999979972839,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.991100013256073,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/gradient-descent","display_name":"Gradient descent","score":0.6911910772323608},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.6139223575592041},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.576771080493927},{"id":"https://openalex.org/keywords/method-of-steepest-descent","display_name":"Method of steepest descent","score":0.5402284860610962},{"id":"https://openalex.org/keywords/descent","display_name":"Descent (aeronautics)","score":0.5248743891716003},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5171917676925659},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5077856183052063},{"id":"https://openalex.org/keywords/parallels","display_name":"Parallels","score":0.5060052275657654},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4834188222885132},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46654391288757324},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.46445274353027344},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4491434693336487},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37692680954933167},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3078613579273224},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.08999234437942505},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07587888836860657}],"concepts":[{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.6911910772323608},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.6139223575592041},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.576771080493927},{"id":"https://openalex.org/C158847443","wikidata":"https://www.wikidata.org/wiki/Q1997812","display_name":"Method of steepest descent","level":2,"score":0.5402284860610962},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.5248743891716003},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5171917676925659},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5077856183052063},{"id":"https://openalex.org/C2775922551","wikidata":"https://www.wikidata.org/wiki/Q7135033","display_name":"Parallels","level":2,"score":0.5060052275657654},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4834188222885132},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46654391288757324},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.46445274353027344},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4491434693336487},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37692680954933167},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3078613579273224},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.08999234437942505},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07587888836860657},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/21m1390037","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21m1390037","pdf_url":null,"source":{"id":"https://openalex.org/S160107561","display_name":"SIAM Review","issn_l":"0036-1445","issn":["0036-1445","1095-7200"],"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 Review","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7413703108","display_name":"Development and Analysis of Algorithms to Simulate Multi-Component Multi-Phase Porous Flows","funder_award_id":"2012259","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W322738573","https://openalex.org/W648446685","https://openalex.org/W1969811075","https://openalex.org/W2065164181","https://openalex.org/W2068484625","https://openalex.org/W2103559027","https://openalex.org/W2123224804","https://openalex.org/W2951523010","https://openalex.org/W2971643127","https://openalex.org/W3197024903","https://openalex.org/W4206742934","https://openalex.org/W4249667877","https://openalex.org/W4250589301","https://openalex.org/W4252112222","https://openalex.org/W4296816584","https://openalex.org/W4299343067","https://openalex.org/W4301021743"],"related_works":["https://openalex.org/W2393439324","https://openalex.org/W2081157561","https://openalex.org/W3197592642","https://openalex.org/W2914176832","https://openalex.org/W131846159","https://openalex.org/W2088010696","https://openalex.org/W2386196923","https://openalex.org/W2027078210","https://openalex.org/W2368086325","https://openalex.org/W2015288657"],"abstract_inverted_index":{"While":[0],"Nesterov's":[1,60,75],"algorithm":[2,37,61,76],"for":[3,23,33],"computing":[4],"the":[5,41,86],"minimum":[6],"of":[7,59,65,74],"a":[8,24,82],"convex":[9,90],"function":[10],"is":[11,18,30,38,48,69],"now":[12],"over":[13],"forty":[14],"years":[15],"old,":[16],"it":[17,47],"rarely":[19],"presented":[20],"in":[21,27,81,96],"texts":[22],"first":[25],"course":[26,98],"optimization.":[28,100],"This":[29,53],"unfortunate":[31],"since":[32],"many":[34],"problems":[35],"this":[36,72],"superior":[39],"to":[40,51],"ubiquitous":[42],"steepest":[43,66,93],"descent":[44,94],"algorithm,":[45],"and":[46,92],"equally":[49],"simple":[50],"implement.":[52],"article":[54],"presents":[55],"an":[56],"elementary":[57],"analysis":[58],"that":[62,64,71],"parallels":[63],"descent.":[67],"It":[68],"envisioned":[70],"presentation":[73],"could":[77],"easily":[78],"be":[79],"covered":[80],"few":[83],"lectures":[84],"following":[85],"introductory":[87],"material":[88],"on":[89,99],"functions":[91],"included":[95],"every":[97]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":4}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}