{"id":"https://openalex.org/W2064555446","doi":"https://doi.org/10.1137/s1052623496303779","title":"Reduced Storage, Quasi-Newton Trust Region Approaches to Function Optimization","display_name":"Reduced Storage, Quasi-Newton Trust Region Approaches to Function Optimization","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2064555446","doi":"https://doi.org/10.1137/s1052623496303779","mag":"2064555446"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623496303779","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623496303779","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/A5025267451","display_name":"Linda Kaufman","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Linda Kaufman","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5025267451"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.22156163,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"10","issue":"1","first_page":"56","last_page":"69"},"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/T11435","display_name":"Polynomial and algebraic computation","score":0.9994999766349792,"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"}},{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9993000030517578,"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.9675087928771973},{"id":"https://openalex.org/keywords/quasi-newton-method","display_name":"Quasi-Newton method","score":0.8117598295211792},{"id":"https://openalex.org/keywords/trust-region","display_name":"Trust region","score":0.7793879508972168},{"id":"https://openalex.org/keywords/broyden\u2013fletcher\u2013goldfarb\u2013shanno-algorithm","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","score":0.7606891393661499},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6233940720558167},{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.5786572098731995},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5696980953216553},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.5611018538475037},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5342195630073547},{"id":"https://openalex.org/keywords/newtons-method","display_name":"Newton's method","score":0.4530775249004364},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.433938592672348},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41444724798202515},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.29387250542640686}],"concepts":[{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.9675087928771973},{"id":"https://openalex.org/C114954040","wikidata":"https://www.wikidata.org/wiki/Q1476018","display_name":"Quasi-Newton method","level":4,"score":0.8117598295211792},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.7793879508972168},{"id":"https://openalex.org/C132721684","wikidata":"https://www.wikidata.org/wiki/Q2877013","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","level":3,"score":0.7606891393661499},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6233940720558167},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.5786572098731995},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5696980953216553},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.5611018538475037},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5342195630073547},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.4530775249004364},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.433938592672348},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41444724798202515},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.29387250542640686},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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/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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s1052623496303779","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623496303779","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.573.2657","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.573.2657","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.princeton.edu/~fhs/kaufmanpaper.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1905385316","https://openalex.org/W1965393410","https://openalex.org/W2016663659","https://openalex.org/W2021484063","https://openalex.org/W2035002995","https://openalex.org/W2035079355","https://openalex.org/W2038469228","https://openalex.org/W2051434435","https://openalex.org/W2051669046","https://openalex.org/W2058839679","https://openalex.org/W2061054410","https://openalex.org/W2068484625","https://openalex.org/W2075184363","https://openalex.org/W2997715027","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2026245502","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/W2572889128","https://openalex.org/W2884245976","https://openalex.org/W2047822102"],"abstract_inverted_index":{"In":[0],"this":[1,108],"paper":[2],"we":[3],"consider":[4],"several":[5],"algorithms":[6,59],"for":[7,21,117,120],"reducing":[8],"the":[9,82,105,112,121,131],"storage":[10,50,67],"when":[11,42,54],"using":[12],"a":[13,17,44,61],"quasi-Newton":[14],"method":[15],"in":[16],"dogleg--trust":[18,95],"region":[19,85,96],"setting":[20],"minimizing":[22,43],"functions":[23],"of":[24,46,107,133],"many":[25],"variables.":[26,48],"Secant":[27],"methods":[28],"require":[29,65,78],"O(n2)":[30,38],"locations":[31],"to":[32,129],"store":[33],"an":[34],"approximate":[35],"Hessian":[36,109,113,122],"and":[37,64,68,92,110,123],"operations":[39,72],"per":[40,73],"iteration":[41],"function":[45],"n":[47,55],"This":[49],"requirement":[51],"becomes":[52,56],"impractical":[53],"large.":[57],"Our":[58,94,115],"use":[60],"BFGS":[62],"update":[63],"kn":[66],"$4kn":[69],"+":[70],"O(k2)":[71],"iteration,":[74],"but":[75],"they":[76],"may":[77],"more":[79],"iterations":[80],"than":[81],"standard":[83],"trust":[84],"techniques.":[86],"Typically":[87],"k":[88],"is":[89],"between":[90],"10":[91],"100.":[93],"strategies":[97],"involve":[98],"expressions":[99,119],"with":[100,103,111],"matrix":[101],"products":[102],"both":[104],"inverse":[106,125],"itself.":[114],"techniques":[116],"updating":[118],"its":[124],"can":[126],"be":[127],"used":[128],"improve":[130],"performance":[132],"line":[134],"search,":[135],"limited":[136],"memory":[137],"algorithms.":[138]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}