{"id":"https://openalex.org/W2563719283","doi":"https://doi.org/10.1080/10556788.2018.1510927","title":"Quasi-Newton methods: superlinear convergence without line searches for self-concordant functions","display_name":"Quasi-Newton methods: superlinear convergence without line searches for self-concordant functions","publication_year":2018,"publication_date":"2018-09-06","ids":{"openalex":"https://openalex.org/W2563719283","doi":"https://doi.org/10.1080/10556788.2018.1510927","mag":"2563719283"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2018.1510927","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2018.1510927","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","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/A5017828790","display_name":"Wenbo Gao","orcid":"https://orcid.org/0000-0002-4471-1870"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Wenbo Gao","raw_affiliation_strings":["Department of Industrial Engineering and Operations Research, Columbia University, New York, NY, USA"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Operations Research, Columbia University, New York, NY, USA","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027297328","display_name":"Donald Goldfarb","orcid":null},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Donald Goldfarb","raw_affiliation_strings":["Department of Industrial Engineering and Operations Research, Columbia University, New York, NY, USA"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Operations Research, Columbia University, New York, NY, USA","institution_ids":["https://openalex.org/I78577930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5017828790"],"corresponding_institution_ids":["https://openalex.org/I78577930"],"apc_list":null,"apc_paid":null,"fwci":3.0425,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.92997804,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"34","issue":"1","first_page":"194","last_page":"217"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9995999932289124,"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.9995999932289124,"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.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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.998199999332428,"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/broyden\u2013fletcher\u2013goldfarb\u2013shanno-algorithm","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","score":0.8702423572540283},{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.7787989974021912},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.750626802444458},{"id":"https://openalex.org/keywords/newtons-method-in-optimization","display_name":"Newton's method in optimization","score":0.6719083786010742},{"id":"https://openalex.org/keywords/quasi-newton-method","display_name":"Quasi-Newton method","score":0.6477494239807129},{"id":"https://openalex.org/keywords/stochastic-gradient-descent","display_name":"Stochastic gradient descent","score":0.5975152254104614},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.5596466064453125},{"id":"https://openalex.org/keywords/proximal-gradient-methods","display_name":"Proximal Gradient Methods","score":0.5589404702186584},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.548234224319458},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5313591957092285},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5189947485923767},{"id":"https://openalex.org/keywords/descent-direction","display_name":"Descent direction","score":0.5056157112121582},{"id":"https://openalex.org/keywords/curvature","display_name":"Curvature","score":0.42579829692840576},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4158766269683838},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.41582125425338745},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4082392156124115},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4071805477142334},{"id":"https://openalex.org/keywords/newtons-method","display_name":"Newton's method","score":0.40147489309310913},{"id":"https://openalex.org/keywords/local-convergence","display_name":"Local convergence","score":0.3533713221549988},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.2981969118118286},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.23047852516174316},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21966394782066345},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08616495132446289}],"concepts":[{"id":"https://openalex.org/C132721684","wikidata":"https://www.wikidata.org/wiki/Q2877013","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","level":3,"score":0.8702423572540283},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.7787989974021912},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.750626802444458},{"id":"https://openalex.org/C179127668","wikidata":"https://www.wikidata.org/wiki/Q17086396","display_name":"Newton's method in optimization","level":4,"score":0.6719083786010742},{"id":"https://openalex.org/C114954040","wikidata":"https://www.wikidata.org/wiki/Q1476018","display_name":"Quasi-Newton method","level":4,"score":0.6477494239807129},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.5975152254104614},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.5596466064453125},{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.5589404702186584},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.548234224319458},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5313591957092285},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5189947485923767},{"id":"https://openalex.org/C116149140","wikidata":"https://www.wikidata.org/wiki/Q2070951","display_name":"Descent direction","level":4,"score":0.5056157112121582},{"id":"https://openalex.org/C195065555","wikidata":"https://www.wikidata.org/wiki/Q214881","display_name":"Curvature","level":2,"score":0.42579829692840576},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4158766269683838},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.41582125425338745},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4082392156124115},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4071805477142334},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.40147489309310913},{"id":"https://openalex.org/C117898588","wikidata":"https://www.wikidata.org/wiki/Q6664310","display_name":"Local convergence","level":3,"score":0.3533713221549988},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.2981969118118286},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.23047852516174316},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21966394782066345},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08616495132446289},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.0},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"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/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556788.2018.1510927","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2018.1510927","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3633974981","display_name":null,"funder_award_id":"CCF-1527809","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W114517082","https://openalex.org/W1632601927","https://openalex.org/W1697545848","https://openalex.org/W1824074430","https://openalex.org/W2005136695","https://openalex.org/W2022772618","https://openalex.org/W2026393324","https://openalex.org/W2030405518","https://openalex.org/W2038210983","https://openalex.org/W2045968916","https://openalex.org/W2051434435","https://openalex.org/W2051669046","https://openalex.org/W2078409719","https://openalex.org/W2107438106","https://openalex.org/W2112820497","https://openalex.org/W2124541940","https://openalex.org/W2153635508","https://openalex.org/W2436943375","https://openalex.org/W2740631809","https://openalex.org/W2963242954","https://openalex.org/W2963813563","https://openalex.org/W2963941964","https://openalex.org/W3089552053","https://openalex.org/W4301014524"],"related_works":["https://openalex.org/W4324358988","https://openalex.org/W2945911381","https://openalex.org/W4387596249","https://openalex.org/W3101185163","https://openalex.org/W2615612939","https://openalex.org/W4287063100","https://openalex.org/W4283726990","https://openalex.org/W2563719283","https://openalex.org/W2758030820","https://openalex.org/W2949437822"],"abstract_inverted_index":{"We":[0,48,81],"consider":[1],"the":[2,56,63,69,92],"use":[3],"of":[4,107],"a":[5,34],"curvature-adaptive":[6,93],"step":[7,31,53,94],"size":[8,32,54,95],"in":[9,55,62,73],"gradient-based":[10],"iterative":[11],"methods,":[12,15],"including":[13],"quasi-Newton":[14,60],"for":[16,25,76],"minimizing":[17],"self-concordant":[18,79],"functions,":[19],"extending":[20],"an":[21],"approach":[22],"first":[23],"proposed":[24],"Newton's":[26],"method":[27,58],"by":[28],"Nesterov.":[29],"This":[30],"has":[33],"simple":[35],"expression":[36],"that":[37,50],"can":[38],"be":[39],"computed":[40],"analytically;":[41],"hence,":[42],"line":[43],"searches":[44],"are":[45],"not":[46],"needed.":[47],"show":[49],"using":[51,91],"this":[52],"BFGS":[57,89],"(and":[59],"methods":[61,90,98],"Broyden":[64],"convex":[65,78],"class":[66],"other":[67],"than":[68],"DFP":[70],"method)":[71],"results":[72],"superlinear":[74],"convergence":[75],"strongly":[77],"functions.":[80],"present":[82],"numerical":[83],"experiments":[84],"comparing":[85],"gradient":[86,109],"descent":[87,110],"and":[88,104],"to":[96,105],"traditional":[97],"on":[99,111],"deterministic":[100],"logistic":[101],"regression":[102],"problems,":[103],"versions":[106],"stochastic":[108,112],"optimization":[113],"problems.":[114]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}