{"id":"https://openalex.org/W2963060476","doi":"https://doi.org/10.1137/15m1021106","title":"Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence","display_name":"Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2963060476","doi":"https://doi.org/10.1137/15m1021106","mag":"2963060476"},"language":"en","primary_location":{"id":"doi:10.1137/15m1021106","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1021106","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/A5001436196","display_name":"Mert Pilanc\u0131","orcid":"https://orcid.org/0000-0002-0870-9992"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mert Pilanci","raw_affiliation_strings":["University of California at Berkeley"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California at Berkeley","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038379562","display_name":"Martin J. Wainwright","orcid":"https://orcid.org/0000-0002-8760-2236"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Martin J. Wainwright","raw_affiliation_strings":["University of California at Berkeley"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California at Berkeley","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":17.5881,"has_fulltext":false,"cited_by_count":187,"citation_normalized_percentile":{"value":0.9983914,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"27","issue":"1","first_page":"205","last_page":"245"},"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.9993000030517578,"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.9993000030517578,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9988999962806702,"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.7625612020492554},{"id":"https://openalex.org/keywords/hessian-matrix","display_name":"Hessian matrix","score":0.7366184592247009},{"id":"https://openalex.org/keywords/newtons-method-in-optimization","display_name":"Newton's method in optimization","score":0.6382718086242676},{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.561486005783081},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.522830069065094},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5079484581947327},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48121002316474915},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.47545096278190613},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4648531675338745},{"id":"https://openalex.org/keywords/newtons-method","display_name":"Newton's method","score":0.41054511070251465},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4050253629684448},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.39855343103408813},{"id":"https://openalex.org/keywords/local-convergence","display_name":"Local convergence","score":0.360862672328949},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20885193347930908},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.20562845468521118},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.14455679059028625}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7625612020492554},{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.7366184592247009},{"id":"https://openalex.org/C179127668","wikidata":"https://www.wikidata.org/wiki/Q17086396","display_name":"Newton's method in optimization","level":4,"score":0.6382718086242676},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.561486005783081},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.522830069065094},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5079484581947327},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48121002316474915},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.47545096278190613},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4648531675338745},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.41054511070251465},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4050253629684448},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.39855343103408813},{"id":"https://openalex.org/C117898588","wikidata":"https://www.wikidata.org/wiki/Q6664310","display_name":"Local convergence","level":3,"score":0.360862672328949},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20885193347930908},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.20562845468521118},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.14455679059028625},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/15m1021106","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1021106","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":[{"id":"https://openalex.org/G101016976","display_name":null,"funder_award_id":"CIF-31712-23800","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1508821865","display_name":null,"funder_award_id":"DMS-1107000","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6368372287","display_name":null,"funder_award_id":"N00014-11- 1-0688","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W106246290","https://openalex.org/W196761320","https://openalex.org/W1491622225","https://openalex.org/W1523985187","https://openalex.org/W1528905581","https://openalex.org/W1546851689","https://openalex.org/W1577111082","https://openalex.org/W1629785033","https://openalex.org/W1632601927","https://openalex.org/W1945899805","https://openalex.org/W1983193888","https://openalex.org/W1984568490","https://openalex.org/W1991083751","https://openalex.org/W1994722534","https://openalex.org/W2007399394","https://openalex.org/W2037757210","https://openalex.org/W2051183908","https://openalex.org/W2063368770","https://openalex.org/W2063978378","https://openalex.org/W2085927849","https://openalex.org/W2107501462","https://openalex.org/W2121689290","https://openalex.org/W2124541940","https://openalex.org/W2124659530","https://openalex.org/W2135046866","https://openalex.org/W2137515395","https://openalex.org/W2152326788","https://openalex.org/W2152402969","https://openalex.org/W2296319761","https://openalex.org/W2592212380","https://openalex.org/W2616345629","https://openalex.org/W2798909945","https://openalex.org/W2950190315","https://openalex.org/W2963459305","https://openalex.org/W2963941964","https://openalex.org/W2965497096","https://openalex.org/W3022380717","https://openalex.org/W3029645440","https://openalex.org/W3100743579"],"related_works":["https://openalex.org/W4388964614","https://openalex.org/W2350788688","https://openalex.org/W4297921956","https://openalex.org/W2951861326","https://openalex.org/W2983297293","https://openalex.org/W2387535608","https://openalex.org/W1985487460","https://openalex.org/W2380062341","https://openalex.org/W2970432723","https://openalex.org/W2026900827"],"abstract_inverted_index":{"We":[0,94,112],"propose":[1],"a":[2,23,58,80],"randomized":[3,76],"second-order":[4],"method":[5],"for":[6,65],"optimization":[7],"known":[8],"as":[9,132,134],"the":[10,33,84],"Newton":[11,20],"sketch:":[12],"it":[13],"is":[14],"based":[15,78],"on":[16,79],"performing":[17],"an":[18],"approximate":[19],"step":[21],"using":[22,75],"randomly":[24],"projected":[25],"Hessian.":[26],"For":[27],"self-concordant":[28,110],"functions,":[29],"we":[30],"prove":[31],"that":[32,47,106],"algorithm":[34,85],"has":[35,87],"superlinear":[36],"convergence":[37,43],"with":[38,42,109,122],"exponentially":[39],"high":[40],"probability,":[41],"and":[44,53,68,114,127],"complexity":[45,90],"guarantees":[46,62],"are":[48,107],"independent":[49],"of":[50,98],"condition":[51],"numbers":[52],"related":[54],"problem-dependent":[55],"quantities.":[56],"Given":[57],"suitable":[59],"initialization,":[60],"similar":[61],"also":[63,95],"hold":[64],"strongly":[66],"convex":[67,104,123],"smooth":[69],"objectives":[70],"without":[71],"self-concordance.":[72],"When":[73],"implemented":[74],"projections":[77],"subsampled":[81],"Hadamard":[82],"basis,":[83],"typically":[86],"substantially":[88],"lower":[89],"than":[91],"Newton's":[92],"method.":[93],"describe":[96],"extensions":[97],"our":[99],"methods":[100],"to":[101,117],"programs":[102,121],"involving":[103],"constraints":[105],"equipped":[108],"barriers.":[111],"discuss":[113],"illustrate":[115],"applications":[116],"linear":[118,130],"programs,":[119],"quadratic":[120],"constraints,":[124],"logistic":[125],"regression,":[126],"other":[128],"generalized":[129],"models,":[131],"well":[133],"semidefinite":[135],"programs.":[136]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":20},{"year":2023,"cited_by_count":16},{"year":2022,"cited_by_count":22},{"year":2021,"cited_by_count":33},{"year":2020,"cited_by_count":41},{"year":2019,"cited_by_count":22},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":12}],"updated_date":"2026-07-18T07:39:51.176621","created_date":"2025-10-10T00:00:00"}