{"id":"https://openalex.org/W2811286826","doi":"https://doi.org/10.1007/s11075-018-0562-7","title":"A diagonal quasi-Newton updating method for unconstrained optimization","display_name":"A diagonal quasi-Newton updating method for unconstrained optimization","publication_year":2018,"publication_date":"2018-06-29","ids":{"openalex":"https://openalex.org/W2811286826","doi":"https://doi.org/10.1007/s11075-018-0562-7","mag":"2811286826"},"language":"en","primary_location":{"id":"doi:10.1007/s11075-018-0562-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11075-018-0562-7","pdf_url":null,"source":{"id":"https://openalex.org/S117494069","display_name":"Numerical Algorithms","issn_l":"1017-1398","issn":["1017-1398","1572-9265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Numerical Algorithms","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/A5010606032","display_name":"Neculai Andrei","orcid":null},"institutions":[{"id":"https://openalex.org/I4210114681","display_name":"National Institute for Research & Development in Informatics","ror":"https://ror.org/028rq5v79","country_code":"RO","type":"facility","lineage":["https://openalex.org/I4210114681"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Neculai Andrei","raw_affiliation_strings":["Research Institute for Informatics, Center for Advanced Modeling and Optimization, 8-10 Averescu Avenue, Bucharest 1, Romania"],"affiliations":[{"raw_affiliation_string":"Research Institute for Informatics, Center for Advanced Modeling and Optimization, 8-10 Averescu Avenue, Bucharest 1, Romania","institution_ids":["https://openalex.org/I4210114681"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5010606032"],"corresponding_institution_ids":["https://openalex.org/I4210114681"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":3.4286,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.92498263,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"81","issue":"2","first_page":"575","last_page":"590"},"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9991999864578247,"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/T12661","display_name":"Iterative Methods for Nonlinear Equations","score":0.9984999895095825,"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/mathematics","display_name":"Mathematics","score":0.8120062947273254},{"id":"https://openalex.org/keywords/hessian-matrix","display_name":"Hessian matrix","score":0.794888436794281},{"id":"https://openalex.org/keywords/diagonal","display_name":"Diagonal","score":0.7095099687576294},{"id":"https://openalex.org/keywords/quasi-newton-method","display_name":"Quasi-Newton method","score":0.6056997179985046},{"id":"https://openalex.org/keywords/diagonal-matrix","display_name":"Diagonal matrix","score":0.5222771167755127},{"id":"https://openalex.org/keywords/broyden\u2013fletcher\u2013goldfarb\u2013shanno-algorithm","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","score":0.5149112939834595},{"id":"https://openalex.org/keywords/descent-direction","display_name":"Descent direction","score":0.5148912668228149},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.5048781037330627},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.49397045373916626},{"id":"https://openalex.org/keywords/newtons-method","display_name":"Newton's method","score":0.48652786016464233},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.47205930948257446},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4261399209499359},{"id":"https://openalex.org/keywords/secant-method","display_name":"Secant method","score":0.4238392114639282},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4222480058670044},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41302645206451416},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39260151982307434},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.3504502773284912},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.2718689739704132},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.21974140405654907},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.13713249564170837}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8120062947273254},{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.794888436794281},{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.7095099687576294},{"id":"https://openalex.org/C114954040","wikidata":"https://www.wikidata.org/wiki/Q1476018","display_name":"Quasi-Newton method","level":4,"score":0.6056997179985046},{"id":"https://openalex.org/C113313756","wikidata":"https://www.wikidata.org/wiki/Q332791","display_name":"Diagonal matrix","level":3,"score":0.5222771167755127},{"id":"https://openalex.org/C132721684","wikidata":"https://www.wikidata.org/wiki/Q2877013","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","level":3,"score":0.5149112939834595},{"id":"https://openalex.org/C116149140","wikidata":"https://www.wikidata.org/wiki/Q2070951","display_name":"Descent direction","level":4,"score":0.5148912668228149},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.5048781037330627},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.49397045373916626},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.48652786016464233},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.47205930948257446},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4261399209499359},{"id":"https://openalex.org/C93926214","wikidata":"https://www.wikidata.org/wiki/Q14915286","display_name":"Secant method","level":4,"score":0.4238392114639282},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4222480058670044},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41302645206451416},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39260151982307434},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.3504502773284912},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.2718689739704132},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.21974140405654907},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13713249564170837},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","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},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","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/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s11075-018-0562-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11075-018-0562-7","pdf_url":null,"source":{"id":"https://openalex.org/S117494069","display_name":"Numerical Algorithms","issn_l":"1017-1398","issn":["1017-1398","1572-9265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Numerical Algorithms","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":22,"referenced_works":["https://openalex.org/W35071470","https://openalex.org/W629937909","https://openalex.org/W1988849934","https://openalex.org/W2012960907","https://openalex.org/W2017014514","https://openalex.org/W2018506570","https://openalex.org/W2051669046","https://openalex.org/W2062294426","https://openalex.org/W2068484625","https://openalex.org/W2069752241","https://openalex.org/W2084236346","https://openalex.org/W2085814643","https://openalex.org/W2112820497","https://openalex.org/W2123019231","https://openalex.org/W2142738245","https://openalex.org/W2149454052","https://openalex.org/W2152996753","https://openalex.org/W2340930132","https://openalex.org/W2767859523","https://openalex.org/W3173138228","https://openalex.org/W4231147569","https://openalex.org/W4236316114"],"related_works":["https://openalex.org/W4315703116","https://openalex.org/W4224046108","https://openalex.org/W2105922132","https://openalex.org/W2572889128","https://openalex.org/W4324358988","https://openalex.org/W4387596249","https://openalex.org/W1993453088","https://openalex.org/W3101185163","https://openalex.org/W2999927963","https://openalex.org/W2945911381"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2}],"updated_date":"2026-04-02T15:55:50.835912","created_date":"2025-10-10T00:00:00"}