TARU PUBLICATIONS
Journal of Interdisciplinary Mathematics cover
Open Access ·Peer-reviewed·ISSN (Online): 2169-012X·ISSN (Print): 0972-0502

Freq.: MONTHLY - Publishes the methodological and theoretical role of mathematics and mathematical applications underpinning scientific research.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Open Access Research Article

Improving the BFGS update for solving unconstrained optimization problems

* ,

* Corresponding author · click or hover a name for details

pp. 59–68Vol. 28Issue 1February 2025DOI: 10.47974/JIM-1770XML
Received:
05 Jun 2024
Published Online:
13 Feb 2025
Article type:
Research Article
Language:
EN
Article no.:
JIM-1770
Pages:
59–68

Abstract

Many quasi-Newton techniques are built on the quasi-Newton’s equation. We are able to get the updated BFGS quasi-Newton updating equations by using the proposed alternative equation.  In this study, a unique y-technique is applied to alter the secant equation of the quasi-Newton techniques. Show how the global convergence of this particular algorithm is associated with the principle of line search. The numerical results demonstrate how well the recommended approach solved the challenges under test.

Keywords

Subject Classifications

90C3065K0549M37

References

[1] P. Mtagulwa and P. Kaelo, “A convergent modified HS-DY hybrid conjugate gradient method for unconstrained optimization problems,” Journal of Information and Optimization Sciences, vol. 40, no. 1, pp. 97–113 (2018), https://doi.org/10.1080/02522667.2018.1424087.
[2] J. Hou, Z. C. Wen and Q. Chang, “An unconstrained optimization reformulation for the Nash game,” J. Interdiscip. Math., vol. 21, no. 5 (2018). https://doi.org/10.1080/09720502.2018.1498003.
[3] A. D. Belegundu and T. R. Chandrupatla, Optimization Concepts and Applications in Engineering, Second Edition (2011).
[4] D. A. Tarzanagh and M. R. Peyghami, “A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems,” J. Global Optim., vol. 63, no. 4 (2015). https://doi.org/10.1007/s10898-015-0310-7.
[5] 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 (2011). https://doi.org/10.1016/j.cam.2010.10.041.
[6] B. A. Hassan, “A new type of quasi-Newton updating formulas based on the new quasi-Newton equation,” Numer. Algebra, Control Optim., vol. 10, no. 2 (2020). https://doi.org/10.3934/naco.2019049.
[7] B. A. Hassan and M. W. Taha, “A new variant of quasi-Newton equation based on the quadratic function for unconstrained optimization,” Indonesian J. Electr. Eng. Comput. Sci., vol. 19, no. 2 (2020). https://doi.org/10.11591/ijeecs.v19.i2.pp701-708.
[8] B. A. Hassan and G. M. Al-Naemi, “A new quasi-Newton equation on the gradient methods for optimization minimization problems,” Indonesian J. Electr. Eng. Comput. Sci., vol. 19, no. 2 (2020). https://doi.org/10.11591/ijeecs.v19.i2.pp737-744.
[9] B. A. Hassan and R. M. Sulaiman, “Using a new type quasi-Newton equation for unconstrained optimization,” in Proceedings of the 7th International Engineering Conference Research and Innovation Amid Global Pandemic (IEC 2021) (2021). https://doi.org/10.1109/IEC52205.2021.9476089.
[10] B. A. Hassan, Z. M. Abdullah and H. N. Jabbar, “A descent extension of the Dai-Yuan conjugate gradient technique,” Indonesian J. Electr. Eng. Comput. Sci., vol. 16, no. 2 (2019). https://doi.org/10.11591/ijeecs.v16.i2.pp661-668.
[11] E. D. Dolan and J. J. Moré, “Benchmarking optimization software with performance profiles,” Mathematical Programming, Series B., vol. 91, no. 2 (2002). https://doi.org/10.1007/s101070100263.
[12] H. N. Jabbar and B. A. Hassan, “Two versions of descent conjugate gradient methods for large-scale unconstrained optimization,” Indonesian J. Electr. Eng. Comput. Sci., vol. 22, no. 3 (2021). https://doi.org/10.11591/ijeecs.v22.i3.pp1643-1649.
[13] M. A. H. Bin Ibrahim, M. Mamat and L. W. June, “BFGS method: A new search direction,” Sains Malays., vol. 43, no. 10 (2014).
[14] R. H. Byrd, J. Nocedal and Y. Ya-Xiang, “Global convergence of a class of quasi-Newton methods on convex problems,” SIAM J. Numer. Anal., vol. 24, no. 5 (1987). https://doi.org/10.1137/0724077.
[15] T. P. Toint, “Global convergence of the portioned BFGS algorithm for convex partially separable optimization,” (1986).
[16] D. H. Li and M. Fukushima, “A modified BFGS method and its global convergence in nonconvex minimization,” J. Comput. Appl. Math., vol. 129, no. 1-2 (2001). https://doi.org/10.1016/S0377-0427(00)00540-9.
[17] G. Yuan and Z. Wei, “Convergence analysis of a modified BFGS method on convex minimizations,” Comput. Optim. Appl., vol. 47, no. 2 (2010). https://doi.org/10.1007/s10589-008-9219-0.
[18] J. Z. Zhang, N. Y. Deng and L. H. Chen, “New quasi-Newton equation and related methods for unconstrained optimization,” J. Optim. Theory Appl., vol. 102, no. 1 (1999). https://doi.org/10.1023/A:1021898630001.
[19] Z. Wei, G. Li and L. Qi, “New quasi-Newton methods for unconstrained optimization problems,” Appl. Math. Comput., vol. 175, no. 2 (2006). https://doi.org/10.1016/j.amc.2005.08.027.
[20] 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 (2006). https://doi.org/10.1007/s10589-006-6440-6.
[21] R. Dehghani, N. Bidabadi and M. M. Hosseini, “A new modified BFGS method for solving systems of nonlinear equations,” J. Interdiscip. Math., vol. 22, no. 1, pp. 75–89 (2019). https://doi.org/10.1080/09720502.2019.1574065.
[22] W. Gao and M. R. Farahani, “The hyper-Zagreb index for an infinite family of nanostar dendrimer,” J. Discrete Math. Sci. Cryptogr., vol. 20, no. 2, pp. 515-523 (2017). https://doi.org/10.1080/09720529.2016.1220088.
[23] W. Gao, L. Shi and M. R. Farahani, “Szeged Related Indices of TUAC6[p, q],” J. Discrete Math. Sci. Cryptogr., vol. 20, no. 2, pp. 553-563 (2017). https://doi.org/10.1080/09720529.2016.1228312.
[24] S. Ahmad, H. M. A. Siddiqui, A. Ali, M. R. Farahani, M. Imran and I. N. Cangul, “On Wiener index and Wiener polarity index of some polyomino chains,” J. Discrete Math. Sci. Cryptogr., vol. 22, no. 7, pp. 1151-1164 (2019). https://doi.org/10.1080/09720529.2019.1688965.
[25] M. Nadeem, S. Ahmad, M. K. Siddiqui, M. A. Ali, M. R. Farahani and A. J. M. Khalaf, “On some applications related with algebraic structures through different well-known graphs,” J. Discrete Math. Sci. Cryptogr., vol. 24, no. 2 (2021). https://doi.org/10.1080/09720529.2021.1885806.
[26] J. J. Moré, B. S. Garbow and K. E. Hillstrom, “Testing unconstrained optimization software,” ACM Trans. Math. Softw., vol. 7, no. 1 (1981). https://doi.org/10.1145/355934.355936.
[27] Y. Yuan and W. Sun, Theory and Methods of Optimization, Science Press of China (1999).
[28] S. M. Kadham, “Acute interstitial pneumonia image enhancement using fuzzy partial transforms,” Applied Geomatics, vol. 16, no. 1, pp. 35–39 (2024).
[29] A. M. Darweesh, R. H. Hasan, and S. M. Kadham, “Results of fourth-order differential superordination and subordination for univalent functions defined by integral operator,” Mathematical Modelling of Engineering Problems, vol. 11, no. 2, pp. 385–392 (2024). [Online]. Available: https://doi.org/10.18280/mmep.110210.
[30] A. Sundud Najah Jabir, S. M. Kadham, M. M. Ahmed Mustafa, and N. K. Abbass, “Encryption and enhance medical image using hybrid transform (Ã-module and partial fuzzy Ĥ-transform),” Journal of Discrete Mathematical Sciences and Cryptography, vol. 26, no. 7, pp. 1903–1910 (2023). [Online]. Available: https://doi.org/10.47974/JDMSC-1683.

Views: 88Downloads: 8Citations: 0