{"id":"https://openalex.org/W2121210949","doi":"https://doi.org/10.1137/060676386","title":"Smooth Optimization with Approximate Gradient","display_name":"Smooth Optimization with Approximate Gradient","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2121210949","doi":"https://doi.org/10.1137/060676386","mag":"2121210949"},"language":"en","primary_location":{"id":"doi:10.1137/060676386","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060676386","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063516752","display_name":"Alexandre d\u2019Aspremont","orcid":"https://orcid.org/0000-0003-3851-216X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Alexandre d'Aspremont","raw_affiliation_strings":["aspremon@princeton.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"aspremon@princeton.edu#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5063516752"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.3392,"has_fulltext":false,"cited_by_count":167,"citation_normalized_percentile":{"value":0.97167682,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"19","issue":"3","first_page":"1171","last_page":"1183"},"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.9998999834060669,"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.9998999834060669,"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.9991999864578247,"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/mathematics","display_name":"Mathematics","score":0.8125656843185425},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.7367969155311584},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.5816630125045776},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5611878037452698},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5275881886482239},{"id":"https://openalex.org/keywords/proximal-gradient-methods","display_name":"Proximal Gradient Methods","score":0.5034505724906921},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.49368223547935486},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.47980430722236633},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.45265713334083557},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.45020735263824463},{"id":"https://openalex.org/keywords/matrix-exponential","display_name":"Matrix exponential","score":0.4123956561088562},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3540240526199341},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.23918652534484863},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.14253360033035278},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.10524499416351318}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8125656843185425},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.7367969155311584},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.5816630125045776},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5611878037452698},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5275881886482239},{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.5034505724906921},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.49368223547935486},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.47980430722236633},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.45265713334083557},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.45020735263824463},{"id":"https://openalex.org/C195906000","wikidata":"https://www.wikidata.org/wiki/Q1191722","display_name":"Matrix exponential","level":3,"score":0.4123956561088562},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3540240526199341},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.23918652534484863},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.14253360033035278},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.10524499416351318},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C78045399","wikidata":"https://www.wikidata.org/wiki/Q11214","display_name":"Differential equation","level":2,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/060676386","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060676386","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1553702074","https://openalex.org/W1974254497","https://openalex.org/W1982604350","https://openalex.org/W2005102197","https://openalex.org/W2006118023","https://openalex.org/W2015263936","https://openalex.org/W2051306216","https://openalex.org/W2060581589","https://openalex.org/W2067136705","https://openalex.org/W2087684630","https://openalex.org/W2088411705","https://openalex.org/W2089559088","https://openalex.org/W2106565812","https://openalex.org/W2124541940","https://openalex.org/W2167732364","https://openalex.org/W2615253071","https://openalex.org/W2798909945","https://openalex.org/W4253016148"],"related_works":["https://openalex.org/W2564735875","https://openalex.org/W4382762952","https://openalex.org/W2079780979","https://openalex.org/W2067382432","https://openalex.org/W2952841129","https://openalex.org/W1969390712","https://openalex.org/W2077924482","https://openalex.org/W2589376966","https://openalex.org/W2029069277","https://openalex.org/W1970439644"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2],"the":[3,15,47,59],"optimal":[4],"complexity":[5],"of":[6,29,46,51],"Nesterov's":[7],"smooth":[8],"first-order":[9],"optimization":[10],"algorithm":[11],"is":[12,17],"preserved":[13],"when":[14],"gradient":[16],"computed":[18],"only":[19,41],"up":[20],"to":[21,32,68],"a":[22,42,52],"small,":[23],"uniformly":[24],"bounded":[25],"error.":[26],"In":[27],"applications":[28],"this":[30,35],"method":[31],"semidefinite":[33],"programs,":[34],"means":[36],"in":[37],"some":[38],"instances":[39],"computing":[40],"few":[43],"leading":[44],"eigenvalues":[45],"current":[48],"iterate":[49],"instead":[50],"full":[53],"matrix":[54],"exponential,":[55],"which":[56],"significantly":[57],"reduces":[58],"method's":[60],"computational":[61],"cost.":[62],"This":[63],"also":[64],"allows":[65],"sparse":[66,73],"problems":[67],"be":[69],"solved":[70],"efficiently":[71],"using":[72],"maximum":[74],"eigenvalue":[75],"packages.":[76]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":18},{"year":2020,"cited_by_count":20},{"year":2019,"cited_by_count":15},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":7}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}