{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T04:48:00Z","timestamp":1766983680138},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,8,17]],"date-time":"2021-08-17T00:00:00Z","timestamp":1629158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,17]],"date-time":"2021-08-17T00:00:00Z","timestamp":1629158400000},"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":["Numer Algor"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s11075-021-01185-8","type":"journal-article","created":{"date-parts":[[2021,8,17]],"date-time":"2021-08-17T05:03:02Z","timestamp":1629176582000},"page":"223-240","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A note on memory-less SR1 and memory-less BFGS methods for large-scale unconstrained optimization"],"prefix":"10.1007","volume":"90","author":[{"given":"Neculai","family":"Andrei","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,17]]},"reference":[{"key":"1185_CR1","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1137\/1011036","volume":"11","author":"P Wolfe","year":"1969","unstructured":"Wolfe, P.: Convergence conditions for ascent methods. SIAM Rev. 11, 226\u2013235 (1969)","journal-title":"SIAM Rev."},{"key":"1185_CR2","doi-asserted-by":"crossref","unstructured":"Wolfe, P.: Convergence conditions for ascent methods. II: Some corrections. SIAM Review. 13, 185\u2013188 (1971)","DOI":"10.1137\/1013035"},{"issue":"99","key":"1185_CR3","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1090\/S0025-5718-1967-0224273-2","volume":"21","author":"CG Broyden","year":"1967","unstructured":"Broyden, C.G.: Quasi-newton methods and their applications to function minimization. Math. Comput. 21(99), 368\u2013381 (1967)","journal-title":"Math. Comput."},{"key":"1185_CR4","doi-asserted-by":"crossref","unstructured":"Davidon, W.C.: Variable metric method for minimization. (Research and Development Report ANL-5990. Argonne National Laboratories.) (1959)","DOI":"10.2172\/4252678"},{"key":"1185_CR5","doi-asserted-by":"crossref","unstructured":"Fiacco, A.V., McCormick, GP.: Nonlinear programming: sequential unconstrained minimization techniques. Research Analysis Corporation, McLean Virginia. Republished in 1990 by SIAM, Philadelphia (1968)","DOI":"10.1137\/1.9781611971316"},{"issue":"1","key":"1185_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0801001","volume":"1","author":"WC Davidon","year":"1991","unstructured":"Davidon, W.C.: Variable metric method for minimization. SIAM J. Optim. 1(1), 1\u201317 (1991)","journal-title":"SIAM J. Optim."},{"key":"1185_CR7","doi-asserted-by":"crossref","unstructured":"Fletcher, R., Powell, M.J.D.: A Rapidly Convergent Descent Method for Minimization, Computer Journal, 163\u2013168 (1963)","DOI":"10.1093\/comjnl\/6.2.163"},{"key":"1185_CR8","doi-asserted-by":"crossref","unstructured":"Powell, M.J.D.: A new algorithm for unconstrained optimization. In: Rosen, J.B., Mangasarian, O.L., Ritter, K. (eds.) Nonlinear Programming, pp. 31\u201366. Academic Press, New York (1970)","DOI":"10.1016\/B978-0-12-597050-1.50006-3"},{"key":"1185_CR9","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1093\/imamat\/6.1.76","volume":"6","author":"CG Broyden","year":"1970","unstructured":"Broyden, C.G.: The convergence of a class of double-rank minimization algorithms. I. General considerations. Journal of the Institute of Mathematics and Its Applications. 6, 76\u201390 (1970)","journal-title":"Journal of the Institute of Mathematics and Its Applications"},{"key":"1185_CR10","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1093\/comjnl\/13.3.317","volume":"13","author":"R Fletcher","year":"1970","unstructured":"Fletcher, R.: A new approach to variable metric algorithms. Comput. J. 13, 317\u2013322 (1970)","journal-title":"Comput. J."},{"key":"1185_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1090\/S0025-5718-1970-0258249-6","volume":"23","author":"D Goldfarb","year":"1970","unstructured":"Goldfarb, D.: A family of variable metric method derived by variation mean. Math. Comput. 23, 23\u201326 (1970)","journal-title":"Math. Comput."},{"key":"1185_CR12","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1090\/S0025-5718-1970-0274029-X","volume":"24","author":"DF Shanno","year":"1970","unstructured":"Shanno, D.F.: Conditioning of quasi-Newton methods for function minimization. Math. Comput. 24, 647\u2013656 (1970)","journal-title":"Math. Comput."},{"issue":"6","key":"1185_CR13","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/BF00927440","volume":"5","author":"HY Huang","year":"1970","unstructured":"Huang, H.Y.: Unified approach to quadratically convergent algorithms for functions minimization. J. Optim. Theory Appl. 5(6), 405\u2013423 (1970)","journal-title":"J. Optim. Theory Appl."},{"key":"1185_CR14","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.cam.2017.04.045","volume":"325","author":"N Andrei","year":"2017","unstructured":"Andrei, N.: Accelerated adaptive Perry conjugate gradient algorithms based on the selfscaling memoryless BFGS update. J. Comput. Appl. Math. 325, 149\u2013164 (2017)","journal-title":"J. Comput. Appl. Math."},{"key":"1185_CR15","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s11075-015-0053-z","volume":"72","author":"S Babaie-Kafaki","year":"2016","unstructured":"Babaie-Kafaki, S.: A modified scaling parameter for the memory-less BFGS updating formula. Numerical Algorithms. 72, 425\u2013433 (2016)","journal-title":"Numerical Algorithms"},{"key":"1185_CR16","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/j.amc.2011.05.080","volume":"218","author":"WJ Leong","year":"2011","unstructured":"Leong, W.J., Hassan, M.A.: Scaled memory-less symmetric rank one method for large-scale optimization. Appl. Math. Comput. 218, 413\u2013418 (2011)","journal-title":"Appl. Math. Comput."},{"key":"1185_CR17","doi-asserted-by":"publisher","first-page":"2054","DOI":"10.3844\/ajassp.2009.2054.2059","volume":"6","author":"F Modarres","year":"2009","unstructured":"Modarres, F., Hassan, M.A., Leong, W.J.: Memory-less modified symmetric rank one method for large-scale unconstrained optimization. Am. J. Appl. Sci. 6, 2054\u20132059 (2009)","journal-title":"Am. J. Appl. Sci."},{"key":"1185_CR18","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1080\/02331934.2014.994625","volume":"65","author":"AU Moyi","year":"2016","unstructured":"Moyi, A.U., Leong, W.J.: A sufficient descent three-term conjugate gradient method via symmetric rank-one update for large-scale optimization. Optimization. 65, 121\u2013143 (2016)","journal-title":"Optimization"},{"key":"1185_CR19","first-page":"53","volume":"61","author":"S Nakayama","year":"2018","unstructured":"Nakayama, S., Narushima, Y., Yabe, H.: A memoryless symmetric rank-one method with sufficient descent property for unconstrained optimization. J. Oper. Res. Soc. Jpn. 61, 53\u201370 (2018)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"1185_CR20","doi-asserted-by":"publisher","first-page":"1773","DOI":"10.3934\/jimo.2018122","volume":"15","author":"S Nakayama","year":"2019","unstructured":"Nakayama, S., Narushima, Y., Yabe, H.: Memory-less quasi-Newton methods based on spectral-scaling Broyden family for unconstrained optimization. Journal of Industrial and Management Optimization. 15, 1773\u20131793 (2019)","journal-title":"Journal of Industrial and Management Optimization"},{"key":"1185_CR21","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.cam.2017.10.013","volume":"332","author":"S Yao","year":"2018","unstructured":"Yao, S., Ning, L.: An adaptive three-term conjugate gradient method based on selfscaling memoryless BFGS matrix. J. Comput. Appl. Math. 332, 72\u201385 (2018)","journal-title":"J. Comput. Appl. Math."},{"key":"1185_CR22","unstructured":"Shanno, D.F.: CONMIN \u2013 a Fortran subroutine for minimizing an unconstrained nonlinear scalar valued function of a vector variable x either by the BFGS variable metric algorithm or by a Beale restarted conjugate gradient algorithm. Private communication, October. 17, (1983)"},{"key":"1185_CR23","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1145\/355666.355673","volume":"2","author":"DF Shanno","year":"1976","unstructured":"Shanno, D.F., Phua, K.H.: Algorithm 500. Minimization of unconstrained multivariable functions. ACM Transactions on Mathematical Software. 2, 87\u201394 (1976)","journal-title":"ACM Transactions on Mathematical Software"},{"key":"1185_CR24","doi-asserted-by":"crossref","unstructured":"Averick, B.M., Carter, R.G., Mor\u00e9, J.J., Xue, G.L.: The MINPACK-2 Test Problem Collection, Mathematics and Computer Science Division, Argonne National Laboratory, Preprint MCS-P153\u20130692 (1992)","DOI":"10.2172\/79972"},{"issue":"1\u20133","key":"1185_CR25","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01594934","volume":"50","author":"AR Conn","year":"1991","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Convergence of quasi-newton matrices generated by the symmetric rank one update. Math. Program. 50(1\u20133), 177\u2013195 (1991)","journal-title":"Math. Program."},{"issue":"1","key":"1185_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0803001","volume":"3","author":"HF Khalfan","year":"1993","unstructured":"Khalfan, H.F., Byrd, R.H., Schnabel, R.B.: A theoretical and experimental study of the symmetric rank-one update. SIAM J. Optimization. 3(1), 1\u201324 (1993)","journal-title":"SIAM J. Optimization"},{"key":"1185_CR27","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1023\/A:1018330119731","volume":"9","author":"CT Kelley","year":"1998","unstructured":"Kelley, C.T., Sachs, E.W.: Local convergence of the symmetric rank one iteration. Comput. Optim. Appl. 9, 43\u201363 (1998)","journal-title":"Comput. Optim. Appl."},{"key":"1185_CR28","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s12532-018-0136-7","volume":"10","author":"HY Benson","year":"2018","unstructured":"Benson, H.Y., Shanno, D.F.: Cubic regularization in symmetric rank-1 quasi-Newton methods. Math. Progr. Comput. 10, 457\u2013486 (2018)","journal-title":"Math. Progr. Comput."},{"key":"1185_CR29","doi-asserted-by":"publisher","first-page":"114042","DOI":"10.1109\/ACCESS.2019.2935900","volume":"7","author":"H Chen","year":"2019","unstructured":"Chen, H., Lam, W.H., Chan, S.C.: On the convergence analysis of cubic regularized symmetric rank-1 quasi-Newton method and the incremental version in the application of large-scale problems. IEEE Access. 7, 114042\u2013114059 (2019)","journal-title":"IEEE Access"},{"key":"1185_CR30","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s002450010019","volume":"43","author":"YH Dai","year":"2001","unstructured":"Dai, Y.H., Liao, L.Z.: New conjugate conditions and related nonlinear conjugate gradient methods. Applied Mathematics & Optimization. 43, 87\u2013101 (2001)","journal-title":"Applied Mathematics & Optimization"},{"key":"1185_CR31","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1017\/S0962492900002270","volume":"1","author":"J Nocedal","year":"1992","unstructured":"Nocedal, J.: Theory of algorithms for unconstrained optimization. Acta Numerica. 1, 199\u2013242 (1992)","journal-title":"Acta Numerica"},{"key":"1185_CR32","unstructured":"Nocedal, J., Wright, S.J.: Numerical optimization. In: Springer Series in Operations Research. Springer Science+Business Media, New York, Second edition (2006)"},{"key":"1185_CR33","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1287\/moor.3.3.244","volume":"3","author":"DF Shanno","year":"1978","unstructured":"Shanno, D.F.: Conjugate gradient methods with inexact searches. Math. Oper. Res. 3, 244\u2013256 (1978a)","journal-title":"Math. Oper. Res."},{"key":"1185_CR34","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1137\/0715085","volume":"15","author":"DF Shanno","year":"1978","unstructured":"Shanno, D.F.: On the convergence of a new conjugate gradient algorithm. SIAM J. Numer. Anal. 15, 1247\u20131257 (1978b)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"1185_CR35","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s11075-006-9023-9","volume":"42","author":"N Andrei","year":"2006","unstructured":"Andrei, N.: An acceleration of gradient descent algorithm with backtracking for unconstrained optimization. Numerical Algorithms. 42(1), 63\u201373 (2006)","journal-title":"Numerical Algorithms"},{"issue":"2","key":"1185_CR36","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/j.amc.2009.03.020","volume":"213","author":"N Andrei","year":"2009","unstructured":"Andrei, N.: Acceleration of conjugate gradient algorithms for unconstrained optimization. Appl. Math. Comput. 213(2), 361\u2013369 (2009)","journal-title":"Appl. Math. Comput."},{"key":"1185_CR37","doi-asserted-by":"crossref","unstructured":"Andrei, N.: Nonlinear conjugate gradient methods for unconstrained optimization. Springer Optimization and Its Applications 158 (2020)","DOI":"10.1007\/978-3-030-42950-8"},{"key":"1185_CR38","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1145\/200979.201043","volume":"21","author":"I Bongartz","year":"1995","unstructured":"Bongartz, I., Conn, A.R., Gould, N.I.M., Toint, P.L.: CUTE: constrained and unconstrained testing environments. ACM Trans. Math. Softw. 21, 123\u2013160 (1995)","journal-title":"ACM Trans. Math. Softw."},{"key":"1185_CR39","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"1185_CR40","doi-asserted-by":"crossref","unstructured":"Glowinski, R.: Numerical methods for nonlinear variational problems, Springer-Verlag, Berlin (1984)","DOI":"10.1007\/978-3-662-12613-4"},{"key":"1185_CR41","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF01441967","volume":"3","author":"G Cimatti","year":"1977","unstructured":"Cimatti, G.: On a problem of the theory of lubrication governed by a variational inequality. Appl. Math. Optim. 3, 227\u2013242 (1977)","journal-title":"Appl. Math. Optim."},{"key":"1185_CR42","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0045-7825(86)90073-3","volume":"57","author":"J Goodman","year":"1986","unstructured":"Goodman, J., Kohn, R., Reyna, L.: Numerical study of a relaxed variational problem from optimal design. Comput. Methods Appl. Mech. Eng. 57, 107\u2013127 (1986)","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"1185_CR43","unstructured":"Aris, R.: The mathematical theory of diffusion and reaction in permeable catalysts. Oxford. (1975)"},{"key":"1185_CR44","doi-asserted-by":"crossref","unstructured":"Bebernes, J., Eberly, D.: Mahematical problems from combustion theory, in: Applied Mathematical Sciences, vol. 83, Springer-Verlag (1989)","DOI":"10.1007\/978-1-4612-4546-9"},{"key":"1185_CR45","unstructured":"Nitsche, J.C.C.: Lectures on minimal surfaces, Vol. 1, Cambridge University Press (1989)"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-021-01185-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-021-01185-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-021-01185-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T12:53:02Z","timestamp":1699361582000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-021-01185-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,17]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["1185"],"URL":"https:\/\/doi.org\/10.1007\/s11075-021-01185-8","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,17]]},"assertion":[{"value":"19 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}