{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T02:28:01Z","timestamp":1768271281357,"version":"3.49.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,6,2]],"date-time":"2020-06-02T00:00:00Z","timestamp":1591056000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,2]],"date-time":"2020-06-02T00:00:00Z","timestamp":1591056000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s40314-020-01157-z","type":"journal-article","created":{"date-parts":[[2020,6,2]],"date-time":"2020-06-02T11:07:02Z","timestamp":1591096022000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A double parameter self-scaling memoryless BFGS method for unconstrained optimization"],"prefix":"10.1007","volume":"39","author":[{"given":"Neculai","family":"Andrei","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,2]]},"reference":[{"key":"1157_CR1","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1023\/A:1018315205474","volume":"9","author":"M Al-Baali","year":"1998","unstructured":"Al-Baali M (1998a) Global and superlinear convergence of a class of self-scaling methods with inexact line search. Comput Optim Appl 9:191\u2013203","journal-title":"Comput Optim Appl"},{"key":"1157_CR2","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1023\/A:1022608410710","volume":"96","author":"M Al-Baali","year":"1998","unstructured":"Al-Baali M (1998b) Numerical experience with a class of self-scaling quasi-Newton algorithms. J Optim Theory Appl 96:533\u2013553","journal-title":"J Optim Theory Appl"},{"key":"1157_CR3","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1016\/j.cam.2008.12.024","volume":"230","author":"N Andrei","year":"2009","unstructured":"Andrei N (2009) Accelerated conjugate gradient algorithm with finite difference Hessian\/vector product approximation for unconstrained optimization. J Comput Appl Math 230:570\u2013582","journal-title":"J Comput Appl Math"},{"key":"1157_CR4","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1080\/10556788.2016.1225211","volume":"32","author":"N Andrei","year":"2017","unstructured":"Andrei N (2017) Eigenvalues versus singular values study in conjugate gradient algorithms for large-scale unconstrained optimization. Optim Methods Softw 32:534\u2013551","journal-title":"Optim Methods Softw"},{"issue":"2","key":"1157_CR5","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s11075-017-0321-1","volume":"77","author":"N Andrei","year":"2018","unstructured":"Andrei N (2018a) An adaptive scaled BFGS method for unconstrained optimization. Numer Algorithms 77(2):413\u2013432","journal-title":"Numer Algorithms"},{"key":"1157_CR6","unstructured":"Andrei N (2018b) A set of unconstrained optimization test problems. Technical Report No. 4\/May 2, 2018. Research Institute for Informatics, Bucharest, pp 1\u201310"},{"key":"1157_CR7","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1145\/200979.201043","volume":"21","author":"I Bongartz","year":"1995","unstructured":"Bongartz I, Conn AR, Gould NIM, Toint PL (1995) CUTE: constrained and unconstrained testing environments. ACM TOMS 21:123\u2013160","journal-title":"ACM TOMS"},{"key":"1157_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan ED, Mor\u00e9 JJ (2002) Benchmarking optimization software with performance profiles. Math Program 91:201\u2013213","journal-title":"Math Program"},{"key":"1157_CR9","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/030601880","volume":"16","author":"WW Hager","year":"2005","unstructured":"Hager WW, Zhang H (2005) A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J Optim 16:170\u2013192","journal-title":"SIAM J Optim"},{"key":"1157_CR10","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/BF00927440","volume":"6","author":"HY Huang","year":"1970","unstructured":"Huang HY (1970) Unified approach to quadratically convergent algorithms for function minimization. J Optim Theory Appl 6:405\u2013423","journal-title":"J Optim Theory Appl"},{"key":"1157_CR11","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/BF01589116","volume":"45","author":"DC Liu","year":"1989","unstructured":"Liu DC, Nocedal J (1989) On the limited-memory BFGS method for large scale optimization. Math Program 45:503\u2013528","journal-title":"Math Program"},{"key":"1157_CR14","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1090\/S0025-5718-1980-0572855-7","volume":"35","author":"J Nocedal","year":"1980","unstructured":"Nocedal J (1980) Updating quasi-Newton matrices with limited storage. Math Comput 35:773\u2013782","journal-title":"Math Comput"},{"key":"1157_CR15","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1017\/S0962492900002270","volume":"1","author":"J Nocedal","year":"1992","unstructured":"Nocedal J (1992) Theory of algorithms for unconstrained optimization. Acta Numer 1:199\u2013242","journal-title":"Acta Numer"},{"key":"1157_CR16","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF01582136","volume":"61","author":"J Nocedal","year":"1993","unstructured":"Nocedal J, Yuan YX (1993) Analysis of self-scaling quasi-Newton method. Math Program 61:19\u201337","journal-title":"Math Program"},{"key":"1157_CR12","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1287\/mnsc.20.5.845","volume":"20","author":"SS Oren","year":"1974","unstructured":"Oren SS, Luenberger DG (1974) Self-scaling variable metric (SSVM) algorithms, part I: criteria and sufficient conditions for scaling a class of algorithms. Manag Sci 20:845\u2013862","journal-title":"Manag Sci"},{"key":"1157_CR13","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/BF01580654","volume":"10","author":"SS Oren","year":"1976","unstructured":"Oren SS, Spedicato E (1976) Optimal conditioning of self-scaling variable metric algorithms. Math Program 10:70\u201390","journal-title":"Math Program"},{"key":"1157_CR17","unstructured":"Perry JM (1977) A class of conjugate gradient algorithms with a two-step variable-metric memory. Discussion Paper 269, Center for Mathematical Studies in Economics and Management Sciences, Northwestern University, Evanston"},{"key":"1157_CR18","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1287\/moor.3.3.244","volume":"3","author":"DF Shanno","year":"1978","unstructured":"Shanno DF (1978) Conjugate gradient methods with inexact searches. Math Oper Res 3:244\u2013256","journal-title":"Math Oper Res"},{"key":"1157_CR19","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF01588962","volume":"14","author":"DF Shanno","year":"1978","unstructured":"Shanno DF, Phua KH (1978) Matrix conditioning and nonlinear optimization. Math Program 14:149\u2013160","journal-title":"Math Program"},{"key":"1157_CR20","volume-title":"Optimization theory and methods. Nonlinear programming","author":"W Sun","year":"2006","unstructured":"Sun W, Yuan YX (2006) Optimization theory and methods. Nonlinear programming. Springer Science + Business Media, New York"},{"key":"1157_CR21","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1137\/1011036","volume":"11","author":"P Wolfe","year":"1969","unstructured":"Wolfe P (1969) Convergence conditions for ascent methods. SIAM Rev 11:226\u2013235","journal-title":"SIAM Rev"},{"key":"1157_CR22","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1137\/1013035","volume":"13","author":"P Wolfe","year":"1971","unstructured":"Wolfe P (1971) Convergence conditions for ascent methods. II: Some corrections. SIAM Rev 13:185\u2013188","journal-title":"SIAM Rev"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-020-01157-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-020-01157-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-020-01157-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,2]],"date-time":"2021-06-02T00:50:04Z","timestamp":1622595004000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-020-01157-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,2]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["1157"],"URL":"https:\/\/doi.org\/10.1007\/s40314-020-01157-z","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,2]]},"assertion":[{"value":"18 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"No potential conflict of interest was reported by the author.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"159"}}