{"id":"https://openalex.org/W4401011298","doi":"https://doi.org/10.1007/s11075-024-01895-9","title":"Limited memory gradient methods for unconstrained optimization","display_name":"Limited memory gradient methods for unconstrained optimization","publication_year":2024,"publication_date":"2024-07-26","ids":{"openalex":"https://openalex.org/W4401011298","doi":"https://doi.org/10.1007/s11075-024-01895-9"},"language":"en","primary_location":{"id":"doi:10.1007/s11075-024-01895-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11075-024-01895-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11075-024-01895-9.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s11075-024-01895-9.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5072928110","display_name":"Giulia Ferrandi","orcid":"https://orcid.org/0000-0002-5672-3094"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Giulia Ferrandi","raw_affiliation_strings":["Department of Mathematics and Computer Science, TU Eindhoven, PO Box 513, Eindhoven, 5600 MB, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, PO Box 513, Eindhoven, 5600 MB, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064293224","display_name":"Michiel E. Hochstenbach","orcid":"https://orcid.org/0000-0002-9196-8257"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Michiel E. Hochstenbach","raw_affiliation_strings":["Department of Mathematics and Computer Science, TU Eindhoven, PO Box 513, Eindhoven, 5600 MB, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, PO Box 513, Eindhoven, 5600 MB, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5072928110"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.6182,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.6301488,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"99","issue":"2","first_page":"735","last_page":"764"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":1.0,"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":1.0,"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/T12661","display_name":"Iterative Methods for Nonlinear Equations","score":0.9990000128746033,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9952999949455261,"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/mathematics","display_name":"Mathematics","score":0.7399331331253052},{"id":"https://openalex.org/keywords/hessian-matrix","display_name":"Hessian matrix","score":0.6763731837272644},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.5570312738418579},{"id":"https://openalex.org/keywords/secant-method","display_name":"Secant method","score":0.5364603996276855},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5325701832771301},{"id":"https://openalex.org/keywords/perturbation","display_name":"Perturbation (astronomy)","score":0.5076442956924438},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.49662357568740845},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4918334484100342},{"id":"https://openalex.org/keywords/numerical-analysis","display_name":"Numerical analysis","score":0.47046908736228943},{"id":"https://openalex.org/keywords/nonlinear-conjugate-gradient-method","display_name":"Nonlinear conjugate gradient method","score":0.4374181628227234},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.43655121326446533},{"id":"https://openalex.org/keywords/method-of-steepest-descent","display_name":"Method of steepest descent","score":0.4355927109718323},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.42211562395095825},{"id":"https://openalex.org/keywords/newtons-method","display_name":"Newton's method","score":0.40755099058151245},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36149024963378906},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32684147357940674},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.2682313919067383},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22205662727355957},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.11476853489875793},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08702710270881653}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7399331331253052},{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.6763731837272644},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.5570312738418579},{"id":"https://openalex.org/C93926214","wikidata":"https://www.wikidata.org/wiki/Q14915286","display_name":"Secant method","level":4,"score":0.5364603996276855},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5325701832771301},{"id":"https://openalex.org/C177918212","wikidata":"https://www.wikidata.org/wiki/Q803623","display_name":"Perturbation (astronomy)","level":2,"score":0.5076442956924438},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.49662357568740845},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4918334484100342},{"id":"https://openalex.org/C48753275","wikidata":"https://www.wikidata.org/wiki/Q11216","display_name":"Numerical analysis","level":2,"score":0.47046908736228943},{"id":"https://openalex.org/C26362088","wikidata":"https://www.wikidata.org/wiki/Q17086453","display_name":"Nonlinear conjugate gradient method","level":4,"score":0.4374181628227234},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.43655121326446533},{"id":"https://openalex.org/C158847443","wikidata":"https://www.wikidata.org/wiki/Q1997812","display_name":"Method of steepest descent","level":2,"score":0.4355927109718323},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.42211562395095825},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.40755099058151245},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36149024963378906},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32684147357940674},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.2682313919067383},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22205662727355957},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.11476853489875793},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08702710270881653},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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":2,"locations":[{"id":"doi:10.1007/s11075-024-01895-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11075-024-01895-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11075-024-01895-9.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Numerical Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/8cb7331f-3d24-4ca5-bb9e-30c6b141ab92","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/8cb7331f-3d24-4ca5-bb9e-30c6b141ab92","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Ferrandi, G & Hochstenbach, M E 2025, 'Limited memory gradient methods for unconstrained optimization', Numerical Algorithms, vol. 99, no. 2, pp. 735-764. https://doi.org/10.1007/s11075-024-01895-9","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s11075-024-01895-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11075-024-01895-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11075-024-01895-9.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Numerical Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6765830016","display_name":null,"funder_award_id":"812912","funder_id":"https://openalex.org/F4320335254","funder_display_name":"Horizon 2020"}],"funders":[{"id":"https://openalex.org/F4320335254","display_name":"Horizon 2020","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4401011298.pdf","grobid_xml":"https://content.openalex.org/works/W4401011298.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W153050556","https://openalex.org/W1741406338","https://openalex.org/W2000359198","https://openalex.org/W2004464554","https://openalex.org/W2012341322","https://openalex.org/W2015131139","https://openalex.org/W2030583950","https://openalex.org/W2039827250","https://openalex.org/W2043430160","https://openalex.org/W2051434435","https://openalex.org/W2057565823","https://openalex.org/W2059586807","https://openalex.org/W2076605490","https://openalex.org/W2081696668","https://openalex.org/W2093575660","https://openalex.org/W2119233169","https://openalex.org/W2149454052","https://openalex.org/W2182853125","https://openalex.org/W2480611454","https://openalex.org/W2963285428","https://openalex.org/W3007862902","https://openalex.org/W3075093238","https://openalex.org/W4289780700","https://openalex.org/W4294564512","https://openalex.org/W4301014524","https://openalex.org/W4307377268","https://openalex.org/W4320912789"],"related_works":["https://openalex.org/W4297883503","https://openalex.org/W3197592642","https://openalex.org/W2355987247","https://openalex.org/W2393217814","https://openalex.org/W2374828024","https://openalex.org/W2060179699","https://openalex.org/W2379811207","https://openalex.org/W3108154714","https://openalex.org/W2957120158","https://openalex.org/W4233700903"],"abstract_inverted_index":{"Abstract":[0],"The":[1],"limited":[2],"memory":[3],"steepest":[4],"descent":[5],"method":[6,28,56,135],"(LMSD,":[7],"Fletcher,":[8],"2012)":[9],"for":[10,111],"unconstrained":[11],"optimization":[12],"problems":[13],"stores":[14],"a":[15,55,71,84,116],"few":[16],"past":[17],"gradients":[18],"to":[19,47,57,97,106,125],"compute":[20,48],"multiple":[21,127],"stepsizes":[22],"at":[23],"once.":[24],"We":[25,65,131],"review":[26],"this":[27,141],"and":[29],"propose":[30,93],"new":[31,49,95],"variants.":[32],"For":[33],"strictly":[34],"convex":[35],"quadratic":[36,113],"objective":[37],"functions,":[38],"we":[39,53,92],"study":[40],"the":[41,59,68,78,88,101,107,112,119],"numerical":[42],"behavior":[43],"of":[44,61,70,103,118],"different":[45],"techniques":[46],"stepsizes.":[50],"In":[51,87],"particular,":[52],"introduce":[54],"improve":[58],"use":[60],"harmonic":[62],"Ritz":[63],"values.":[64],"also":[66,137],"show":[67,132],"existence":[69],"secant":[72,108,128],"condition":[73,109],"associated":[74],"with":[75],"LMSD,":[76],"where":[77],"approximating":[79],"Hessian":[80],"is":[81],"projected":[82],"onto":[83],"low-dimensional":[85],"space.":[86],"general":[89],"nonlinear":[90],"case,":[91],"two":[94],"alternatives":[96],"Fletcher\u2019s":[98,134],"method:":[99],"first,":[100],"addition":[102],"symmetry":[104],"constraints":[105],"valid":[110],"case;":[114],"second,":[115],"perturbation":[117],"last":[120],"differences":[121],"between":[122],"consecutive":[123],"gradients,":[124],"satisfy":[126],"equations":[129],"simultaneously.":[130],"that":[133],"can":[136],"be":[138],"interpreted":[139],"from":[140],"viewpoint.":[142]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}