References
- R. Dehghani, M. M. Hosseini, and N. Bidabadi, “The modified BFGS method with new secant relation for unconstrained optimization problems,” Comput. Methods Differ. Equations, vol. 7, no. 1, pp. 28–41, 2019.
- D. P. O’Leary, “A discrete Newton algorithm for minimizing a function of many variables,” Math. Program., vol. 23, no. 1, pp. 20–33, 1982. doi: https://doi.org/10.1007/BF01583777
- A. H. Basim and K. K. Hussein, “A new class of BFGS updating formula based on the new quasi-newton equation,” Indones. J. Electr. Eng. Comput. Sci., vol. 3, pp. 945–953, 2019.
- G. Yuan, Z. Wei, and X. Lu, “Global convergence of BFGS and PRP methods under a modified weak Wolfe--Powell line search,” Appl. Math. Model., vol. 47, pp. 811–825, 2017. doi: https://doi.org/10.1016/j.apm.2017.02.008
- G. Yuan, Z. Sheng, B. Wang, W. Hu, and C. Li, “The global convergence of a modified BFGS method for nonconvex functions,” J. Comput. Appl. Math., vol. 327, pp. 274–294, 2018. doi: https://doi.org/10.1016/j.cam.2017.05.030
- Y.-H. Dai, “Convergence properties of the BFGS algoritm,” SIAM J. Optim., vol. 13, no. 3, pp. 693–701, 2002. doi: https://doi.org/10.1137/S1052623401383455
- Z. Wei, G. Li, and L. Qi, “New quasi-Newton methods for unconstrained optimization problems,” Appl. Math. Comput., vol. 175, no. 2, pp. 1156–1188, 2006.
- F. Biglari, M. A. Hassan, and W. J. Leong, “New quasi-Newton methods via higher order tensor models,” J. Comput. Appl. Math., vol. 235, no. 8, pp. 2412–2422, 2011. doi: https://doi.org/10.1016/j.cam.2010.10.041
- L. H. Chen, N. Y. Deng, and J. Z. Zhang, “A modified quasi-Newton method for structured optimization with partial information on the Hessian,” Comput. Optim. Appl., vol. 35, no. 1, pp. 5–18, 2006. doi: https://doi.org/10.1007/s10589-006-6440-6
- B. A. Hassan, “A new type of quasi-Newton updating formulas based on the new quasi-Newton equation,” Numer. Algebr. Control \& Optim., vol. 10, no. 2, p. 227, 2020.
- G. Yuan and Z. Wei, “Convergence analysis of a modified BFGS method on convex minimizations,” Comput. Optim. Appl., vol. 47, no. 2, pp. 237–255, 2010. doi: https://doi.org/10.1007/s10589-008-9219-0
- G. Yuan, Z. Wei, and Y. Wu, “Modified limited memory BFGS method with nonmonotone line search for unconstrained optimization,” J. Korean Math. Soc., vol. 47, no. 4, pp. 767–788, 2010. doi: https://doi.org/10.4134/JKMS.2010.47.4.767
- Z. Wan, K. L. Teo, X. Shen, and C. Hu, “New BFGS method for unconstrained optimization problem based on modified Armijo line search,” Optimization, vol. 63, no. 2, pp. 285–304, 2014. doi: https://doi.org/10.1080/02331934.2011.644284
- P. Mtagulwa and P. Kaelo, “A convergent modified HS-DY hybrid conjugate gradient method for unconstrained optimization problems,” J. Inf. Optim. Sci., vol. 40, no. 1, pp. 97–113, 2019.
- B. A. Hassan and M. W. Taha, “A new variants of quasi-newton equation based on the quadratic function for unconstrained optimization,” Indones. J. Electr. Eng. Comput. Sci., vol. 19, no. 2, pp. 701–708, 2020. doi: https://doi.org/10.11591/ijeecs.v19.i2.pp701-708
- X. Fang, Q. Ni, and M. Zeng, “A modified quasi-Newton method for nonlinear equations,” J. Comput. Appl. Math., vol. 328, pp. 44–58, 2018. doi: https://doi.org/10.1016/j.cam.2017.06.024
- Y. H. Xiao, Z. X. Wei, and L. Zhang, “A modified BFGS method without line searches for nonconvex unconstrained optimization,” Adv. Theor. Appl. Math, vol. 1, no. 2, pp. 149–162, 2006.
- W. Findeisen, J. Szymanowski, and A. Wierzbicki, “Theory and Methods of Optimization,” Warsaw Polish Sci. Publ., 1977.
- J. J. Moré, B. S. Garbow, and K. E. Hillstrom, “Testing unconstrained optimization software,” ACM Trans. Math. Softw., vol. 7, no. 1, pp. 17–41, 1981. doi: https://doi.org/10.1145/355934.355936