{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T07:01:02Z","timestamp":1774594862822,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T00:00:00Z","timestamp":1684800000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T00:00:00Z","timestamp":1684800000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s10288-023-00544-6","type":"journal-article","created":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T18:32:17Z","timestamp":1684866737000},"page":"235-252","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A new self-scaling memoryless quasi-Newton update for unconstrained optimization"],"prefix":"10.1007","volume":"22","author":[{"given":"M.","family":"Jourak","sequence":"first","affiliation":[]},{"given":"S.","family":"Nezhadhosein","sequence":"additional","affiliation":[]},{"given":"F.","family":"Rahpeymaii","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,23]]},"reference":[{"key":"544_CR1","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.apnum.2021.05.002","volume":"167","author":"Z Aminifard","year":"2021","unstructured":"Aminifard Z, Babaie-Kafaki S, Ghafoori S (2021) An augmented memoryless BFGS method based on a modified secant equation with application to compressed sensing. Appl Numer Math 167:187\u2013201","journal-title":"Appl Numer Math"},{"issue":"3","key":"544_CR2","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(3):534\u2013551","journal-title":"Optim Methods Softw"},{"issue":"2","key":"544_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10092-020-00365-7","volume":"57","author":"N Andrei","year":"2020","unstructured":"Andrei N (2020) New conjugate gradient algorithms based on self-scaling memoryless broyden-fletcher-goldfarb-shanno method. Calcolo 57(2):1\u201327","journal-title":"Calcolo"},{"issue":"3","key":"544_CR4","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s40314-020-01157-z","volume":"39","author":"N Andrei","year":"2020","unstructured":"Andrei N (2020) A double parameter self-scaling memoryless BFGS method for unconstrained optimization. Comput Appl Math 39(3):159\u201314. https:\/\/doi.org\/10.1007\/s40314-020-01157-z","journal-title":"Comput Appl Math"},{"issue":"2","key":"544_CR5","doi-asserted-by":"publisher","first-page":"361","DOI":"10.3336\/gm.52.2.12","volume":"52","author":"MR Arazm","year":"2017","unstructured":"Arazm MR, Babaie-Kafaki S, Ghanbari R (2017) An extended dai-liao conjugate gradient method with global convergence for nonconvex functions. Glasnik matemati\u010dki 52(2):361\u2013375","journal-title":"Glasnik matemati\u010dki"},{"key":"544_CR6","doi-asserted-by":"crossref","unstructured":"Babaie-Kafaki, S., Mirhoseini, N., Aminifard, Z.: A descent extension of a modified polak\u2013ribi\u00e8re\u2013polyak method with application in image restoration problem. Opt Lett (2022)","DOI":"10.1007\/s11590-022-01878-6"},{"issue":"4","key":"544_CR7","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10288-013-0233-4","volume":"11","author":"S Babaie-Kafaki","year":"2013","unstructured":"Babaie-Kafaki S (2013) A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization. 4OR 11(4):361\u2013374. https:\/\/doi.org\/10.1007\/s10288-013-0233-4","journal-title":"4OR"},{"issue":"2","key":"544_CR8","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 (2016) A modified scaling parameter for the memoryless BFGS updating formula. Numer Algorithms 72(2):425\u2013433","journal-title":"Numer Algorithms"},{"issue":"4","key":"544_CR9","doi-asserted-by":"publisher","first-page":"1345","DOI":"10.1007\/s11075-019-00658-1","volume":"82","author":"S Babaie-Kafaki","year":"2019","unstructured":"Babaie-Kafaki S, Aminifard Z (2019) Two-parameter scaled memoryless BFGS methods with a nonmonotone choice for the initial step length. Numer Algorithms 82(4):1345\u20131357","journal-title":"Numer Algorithms"},{"issue":"3","key":"544_CR10","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1137\/0726042","volume":"26","author":"RH Byrd","year":"1989","unstructured":"Byrd RH, Nocedal J (1989) A tool for the analysis of quasi-Newton methods with application to unconstrained minimization. SIAM J Numer Anal 26(3):727\u2013739. https:\/\/doi.org\/10.1137\/0726042","journal-title":"SIAM J Numer Anal"},{"issue":"1","key":"544_CR11","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/100813026","volume":"23","author":"Y-H Dai","year":"2013","unstructured":"Dai Y-H, Kou C-X (2013) A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search. SIAM J Optim 23(1):296\u2013320. https:\/\/doi.org\/10.1137\/100813026","journal-title":"SIAM J Optim"},{"issue":"5","key":"544_CR12","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1137\/0730067","volume":"30","author":"JE Dennis Jr","year":"1993","unstructured":"Dennis JE Jr, Wolkowicz H (1993) Sizing and least-change secant methods. SIAM J Numer Anal 30(5):1291\u20131314. https:\/\/doi.org\/10.1137\/0730067","journal-title":"SIAM J Numer Anal"},{"issue":"2, Ser. A","key":"544_CR13","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(2, Ser. A):201\u2013213. https:\/\/doi.org\/10.1007\/s101070100263","journal-title":"Math Program"},{"issue":"4","key":"544_CR14","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"NI Gould","year":"2003","unstructured":"Gould NI, Orban D, Toint PL (2003) Cuter and sifdec: a constrained and unconstrained testing environment, revisited. ACM Trans Math Softw (TOMS) 29(4):373\u2013394","journal-title":"ACM Trans Math Softw (TOMS)"},{"issue":"12","key":"544_CR15","doi-asserted-by":"publisher","first-page":"6252","DOI":"10.1109\/TNNLS.2018.2827778","volume":"29","author":"AR Heravi","year":"2018","unstructured":"Heravi AR, Hodtani GA (2018) A new correntropy-based conjugate gradient backpropagation algorithm for improving training in neural networks. IEEE Trans Neural Netw Learn Syst 29(12):6252\u20136263","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"544_CR16","doi-asserted-by":"publisher","unstructured":"Li, D.-H., Fukushima, M.: A modified BFGS method and its global convergence in nonconvex minimization. J Comput Appl Math 129:15\u201335 (2001). https:\/\/doi.org\/10.1016\/S0377-0427(00)00540-9. Nonlinear programming and variational inequalities (Kowloon, 1998)","DOI":"10.1016\/S0377-0427(00)00540-9"},{"issue":"2","key":"544_CR17","doi-asserted-by":"publisher","first-page":"955","DOI":"10.1007\/s11063-017-9737-9","volume":"48","author":"W Li","year":"2018","unstructured":"Li W, Liu Y, Yang J, Wu W (2018) A new conjugate gradient method with smoothing $$ l_ {1\/2}$$ regularization based on a modified secant equation for training neural networks. Neural Process Lett 48(2):955\u2013978","journal-title":"Neural Process Lett"},{"issue":"1\u20132","key":"544_CR18","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s12190-017-1141-0","volume":"58","author":"M Li","year":"2018","unstructured":"Li M, Liu H, Liu Z (2018) A new family of conjugate gradient methods for unconstrained optimization. J Appl Math Comput 58(1\u20132):219\u2013234. https:\/\/doi.org\/10.1007\/s12190-017-1141-0","journal-title":"J Appl Math Comput"},{"issue":"4","key":"544_CR19","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0167-6377(96)00050-8","volume":"20","author":"A Liao","year":"1997","unstructured":"Liao A (1997) Modifying the BFGS method. Oper Res Lett 20(4):171\u2013177. https:\/\/doi.org\/10.1016\/S0167-6377(96)00050-8","journal-title":"Oper Res Lett"},{"issue":"4","key":"544_CR20","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1007\/s11075-018-0479-1","volume":"79","author":"IE Livieris","year":"2018","unstructured":"Livieris IE, Tampakas V, Pintelas P (2018) A descent hybrid conjugate gradient method based on the memoryless BFGS update. Numerical Algorithms 79(4):1169\u20131185","journal-title":"Numerical Algorithms"},{"key":"544_CR21","doi-asserted-by":"publisher","unstructured":"Oren, S.S., Luenberger, D.G.: Self-scaling variable metric (SSVM) algorithms. I. Criteria and sufficient conditions for scaling a class of algorithms. Manag. Sci. 20:845\u2013862 (1973\/74). https:\/\/doi.org\/10.1287\/mnsc.20.5.845. Mathematical programming","DOI":"10.1287\/mnsc.20.5.845"},{"issue":"1","key":"544_CR22","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(1):70\u201390. https:\/\/doi.org\/10.1007\/BF01580654","journal-title":"Math. Program."},{"issue":"3","key":"544_CR23","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/s10957-011-9960-x","volume":"153","author":"K Sugiki","year":"2012","unstructured":"Sugiki K, Narushima Y, Yabe H (2012) Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization. J Optim Theory Appl 153(3):733\u2013757. https:\/\/doi.org\/10.1007\/s10957-011-9960-x","journal-title":"J Optim Theory Appl"},{"key":"544_CR24","first-page":"687","volume-title":"Optimization theory and methods: nonlinear programming. Springer optimization and its applications","author":"W Sun","year":"2006","unstructured":"Sun W, Yuan Y-X (2006) Optimization theory and methods: nonlinear programming. Springer optimization and its applications, vol 1. Springer, New York, p 687"},{"issue":"5","key":"544_CR25","doi-asserted-by":"publisher","first-page":"2374","DOI":"10.1002\/nla.2374","volume":"28","author":"N Ullah","year":"2021","unstructured":"Ullah N, Sabi\u2019u J, Shah A (2021) A derivative-free scaling memoryless Broyden-Fletcher-Goldfarb-shanno method for solving a system of monotone nonlinear equations. Numer Linear Algebra Appl 28(5):2374","journal-title":"Numer Linear Algebra Appl"},{"issue":"2","key":"544_CR26","doi-asserted-by":"publisher","first-page":"1156","DOI":"10.1016\/j.amc.2005.08.027","volume":"175","author":"Z Wei","year":"2006","unstructured":"Wei Z, Li G, Qi L (2006) New quasi-Newton methods for unconstrained optimization problems. Appl Math Comput 175(2):1156\u20131188. https:\/\/doi.org\/10.1016\/j.amc.2005.08.027","journal-title":"Appl Math Comput"},{"issue":"2","key":"544_CR27","doi-asserted-by":"publisher","first-page":"1156","DOI":"10.1016\/j.amc.2005.08.027","volume":"175","author":"Z Wei","year":"2006","unstructured":"Wei Z, Li G, Qi L (2006) New quasi-Newton methods for unconstrained optimization problems. Appl Math Comput 175(2):1156\u20131188. https:\/\/doi.org\/10.1016\/j.amc.2005.08.027","journal-title":"Appl Math Comput"},{"issue":"67\u201368","key":"544_CR28","first-page":"7","volume":"35","author":"S Wright","year":"1999","unstructured":"Wright S, Nocedal J et al (1999) Numerical optimization. Science 35(67\u201368):7","journal-title":"Science"},{"issue":"5","key":"544_CR29","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/j.aml.2010.01.010","volume":"23","author":"G Yu","year":"2010","unstructured":"Yu G, Huang J, Zhou Y (2010) A descent spectral conjugate gradient method for impulse noise removal. Appl Math Lett 23(5):555\u2013560. https:\/\/doi.org\/10.1016\/j.aml.2010.01.010","journal-title":"Appl Math Lett"},{"key":"544_CR30","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/j.cam.2017.05.030","volume":"327","author":"G Yuan","year":"2018","unstructured":"Yuan G, Sheng Z, Wang B, Hu W, Li C (2018) The global convergence of a modified BFGS method for nonconvex functions. J Comput Appl Math 327:274\u2013294. https:\/\/doi.org\/10.1016\/j.cam.2017.05.030","journal-title":"J Comput Appl Math"},{"key":"544_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.apnum.2020.01.019","volume":"152","author":"G Yuan","year":"2020","unstructured":"Yuan G, Lu J, Wang Z (2020) The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems. Appl Numer Math 152:1\u201311. https:\/\/doi.org\/10.1016\/j.apnum.2020.01.019","journal-title":"Appl Numer Math"},{"issue":"4","key":"544_CR32","doi-asserted-by":"publisher","first-page":"35-21","DOI":"10.1007\/s10092-020-00383-5","volume":"57","author":"G Yuan","year":"2020","unstructured":"Yuan G, Wang Z, Li P (2020) A modified Broyden family algorithm with global convergence under a weak Wolfe\u2013Powell line search for unconstrained nonconvex problems. Calcolo 57(4):35\u201321. https:\/\/doi.org\/10.1007\/s10092-020-00383-5","journal-title":"Calcolo"},{"key":"544_CR33","doi-asserted-by":"publisher","first-page":"107634","DOI":"10.1016\/j.aml.2021.107634","volume":"124","author":"G Yuan","year":"2022","unstructured":"Yuan G, Zhang M, Zhou Y (2022) Adaptive scaling damped BFGS method without gradient Lipschitz continuity. Appl Math Lett 124:107634\u20137. https:\/\/doi.org\/10.1016\/j.aml.2021.107634","journal-title":"Appl Math Lett"},{"issue":"1","key":"544_CR34","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1023\/A:1021898630001","volume":"102","author":"JZ Zhang","year":"1999","unstructured":"Zhang JZ, Deng NY, Chen LH (1999) New quasi-Newton equation and related methods for unconstrained optimization. J Optim Theory Appl 102(1):147\u2013167. https:\/\/doi.org\/10.1023\/A:1021898630001","journal-title":"J Optim Theory Appl"},{"issue":"5","key":"544_CR35","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1080\/10556780500137041","volume":"21","author":"W Zhou","year":"2006","unstructured":"Zhou W, Zhang L (2006) A nonlinear conjugate gradient method based on the MBFGS secant condition. Optim Methods Softw 21(5):707\u2013714. https:\/\/doi.org\/10.1080\/10556780500137041","journal-title":"Optim Methods Softw"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-023-00544-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10288-023-00544-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-023-00544-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,3]],"date-time":"2024-06-03T11:08:07Z","timestamp":1717412887000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10288-023-00544-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,23]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["544"],"URL":"https:\/\/doi.org\/10.1007\/s10288-023-00544-6","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,23]]},"assertion":[{"value":"6 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}