{"id":"https://openalex.org/W2095211439","doi":"https://doi.org/10.1137/0803001","title":"A Theoretical and Experimental Study of the Symmetric Rank-One Update","display_name":"A Theoretical and Experimental Study of the Symmetric Rank-One Update","publication_year":1993,"publication_date":"1993-02-01","ids":{"openalex":"https://openalex.org/W2095211439","doi":"https://doi.org/10.1137/0803001","mag":"2095211439"},"language":"en","primary_location":{"id":"doi:10.1137/0803001","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0803001","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/A5050018842","display_name":"Humaid Khalfan","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"H. Fayez Khalfan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110661221","display_name":"Richard H. Byrd","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. H. Byrd","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5020130685","display_name":"R. B. Schnabel","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. B. Schnabel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5050018842"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.2389,"has_fulltext":false,"cited_by_count":119,"citation_normalized_percentile":{"value":0.95459082,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"3","issue":"1","first_page":"1","last_page":"24"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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.9977999925613403,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9807000160217285,"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/hessian-matrix","display_name":"Hessian matrix","score":0.820925235748291},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8129944801330566},{"id":"https://openalex.org/keywords/broyden\u2013fletcher\u2013goldfarb\u2013shanno-algorithm","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","score":0.7962449789047241},{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.7714420557022095},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.6776363253593445},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.6673570871353149},{"id":"https://openalex.org/keywords/quasi-newton-method","display_name":"Quasi-Newton method","score":0.6323999166488647},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5804122090339661},{"id":"https://openalex.org/keywords/trust-region","display_name":"Trust region","score":0.5570653676986694},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.517595648765564},{"id":"https://openalex.org/keywords/independence","display_name":"Independence (probability theory)","score":0.5043984651565552},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.47538530826568604},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.46399399638175964},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4542180001735687},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32879015803337097},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.22863566875457764},{"id":"https://openalex.org/keywords/newtons-method","display_name":"Newton's method","score":0.17511501908302307},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16406092047691345},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.13020318746566772},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07531622052192688}],"concepts":[{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.820925235748291},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8129944801330566},{"id":"https://openalex.org/C132721684","wikidata":"https://www.wikidata.org/wiki/Q2877013","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","level":3,"score":0.7962449789047241},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.7714420557022095},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.6776363253593445},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.6673570871353149},{"id":"https://openalex.org/C114954040","wikidata":"https://www.wikidata.org/wiki/Q1476018","display_name":"Quasi-Newton method","level":4,"score":0.6323999166488647},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5804122090339661},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.5570653676986694},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.517595648765564},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.5043984651565552},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.47538530826568604},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.46399399638175964},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4542180001735687},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32879015803337097},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.22863566875457764},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.17511501908302307},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16406092047691345},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.13020318746566772},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07531622052192688},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0803001","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0803001","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W291003596","https://openalex.org/W1965776043","https://openalex.org/W1992976319","https://openalex.org/W2038210983","https://openalex.org/W2048221927","https://openalex.org/W2053964895","https://openalex.org/W2056603712","https://openalex.org/W2060217404","https://openalex.org/W2062294426","https://openalex.org/W2068484625","https://openalex.org/W2075184363","https://openalex.org/W2084236346","https://openalex.org/W2112820497","https://openalex.org/W2148589597","https://openalex.org/W2236623899","https://openalex.org/W2326806701","https://openalex.org/W4212997115"],"related_works":["https://openalex.org/W2026245502","https://openalex.org/W3012383564","https://openalex.org/W4318192194","https://openalex.org/W2360946740","https://openalex.org/W2070932288","https://openalex.org/W4221162014","https://openalex.org/W2937637171","https://openalex.org/W1964096161","https://openalex.org/W2884245976","https://openalex.org/W2047822102"],"abstract_inverted_index":{"This":[0,89,119],"paper":[1,90],"first":[2],"discusses":[3],"computational":[4,134],"experience":[5],"using":[6],"the":[7,25,31,42,48,60,63,69,77,98,113,123],"SRi":[8,26,49,70,99],"update":[9],"in":[10,85],"conventional":[11],"line":[12,103],"search":[13,104],"and":[14,62,129],"trust":[15],"region":[16],"algorithms":[17],"for":[18],"unconstrained":[19],"optimization.":[20],"The":[21],"experiments":[22],"show":[23],"that":[24,82,95,97,122],"is":[27,83,105],"very":[28],"competitive":[29],"with":[30,101],"widely":[32],"used":[33],"BFGS":[34],"method.":[35],"They":[36],"also":[37],"indicate":[38],"two":[39],"interesting":[40],"features:":[41],"final":[43],"Hessian":[44,124],"approximations":[45,125],"produced":[46,58,67],"by":[47,59,68],"method":[50,100],"are":[51,126,136],"not":[52,72],"generally":[53],"appreciably":[54],"better":[55],"than":[56],"those":[57],"BFGS,":[61],"sequences":[64],"of":[65,115],"steps":[66],"do":[71],"usually":[73],"seem":[74],"to":[75],"have":[76],"\u201cuniform":[78],"linear":[79],"independence\u201d":[80],"property":[81],"assumed":[84],"recent":[86],"convergence":[87],"analysis.":[88],"presents":[91],"a":[92,102],"new":[93],"analysis":[94,120],"shows":[96],"$(":[106],"n":[107],"+":[108],"1)$-step":[109],"q-superlinearly":[110],"convergent":[111],"without":[112],"assumption":[114],"linearly":[116],"independent":[117],"iterates.":[118],"assumes":[121],"positive":[127],"definite":[128],"bounded":[130],"asymptotically,":[131],"which,":[132],"from":[133],"experience,":[135],"reasonable":[137],"assumptions.":[138]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":6}],"updated_date":"2026-05-10T08:33:47.465468","created_date":"2025-10-10T00:00:00"}