Using a new class quasi-Newton equation for solving unconstrained optimization problems

Hassan, Basim A.; Jabbar, Hawraz N.

doi:10.47974/JIM-1493

Open Access A

Using a new class quasi-Newton equation for solving unconstrained optimization problems

^*Basim A. HassanCorresponding authorbasimah@uomosul.edu.iqDepartment of MathematicsCollege of Computers Sciences and MathematicsMosulUniversity of MosulIraq0000-0003-3510-9818View full profile → , Hawraz N. Jabbarhawrazmath@gmail.comDepartment of MathematicsCollege of SciencesKirkukUniversity of KirkukIraq0000-0001-6867-8027View full profile →

* Corresponding author · click or hover a name for details

pp. 289–300Vol. 26Issue 2March 2023DOI: 10.47974/JIM-1493XML

Received:: 05 Jul 2021
Accepted:: 05 Feb 2022
Published Online:: 01 Mar 2023
Article type:: A
Language:: EN
Article no.:: JIM-1493
Pages:: 289–300

Abstract

The quasi-Newton plays a basic role in constructing the Hessian approximation, and quasi-Newton algorithms are built based on it. In this paper, a new class quasi-Newton equation is presented. The proposed method always generates a new descent search direction. Under appropriate conditions, the new method is proved to possess global convergence. Comparative results show the computational efficiency of the proposed method.

Keywords

Unconstrined optimization Quasi-Newton equations Global convergence

Subject Classifications

90C3065K0590C5349M37

References

[1] Ashok D. B. and Tirupathi R. C., (2011), Optimization Concepts and Applications in Engineering, New York, Rowan University.
[2] Ataee D.T. and Reza M. P., (2015), A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems, J of Global Opt., 63, pp.709-728.
[3] Biglari F., Hassan M.A., and Leong W. J.,(2011),’ New quasi-Newton methods via higher-order tensor models, J. Comput. Appl. Math. , (8) pp. 2412-2422.
[4] Basim A.H., (2020), A new type of quasi-Newton updating formulas based on the new quasi-Newton equation, SIAM J. Numerical Algebra, Control, and Optimization. 10, 2, pp.227-235.
[5] Basim A. Hassan and Mohammed W. T., (2020),’’ A New Variants of Quasi-Newton Equation Based on the Quadratic Function for Unconstrained Optimization, Indonesian Journal of Electrical Engineering and Computer Science, 19,(2), pp.701–708.
[6] Basim A.H. and Ghada M., (2020),’’ A New Quasi-Newton Equation on the Gradient Methods for Optimization Minimization Problem, Indonesian Journal of Electrical Engin. and Computer Science, 19,(2), pp. 737-744.
[7] Basim A.H. and Ranen M. Sulaiman (2020),’’ Using a New Type Quasi-Newton Equation for Unconstrained Optimization’’, 7th International Engineering Conference Research & Innovation amid Global Pandemic, Erbil, Iraq, pp.188-122.
[8] Basim A. Hassan, Zeyad M. A., Hawraz N. J., (2019), A descent extension of the Dai - Yuan conjugate gradient technique, Indonesian Journal of Electrical Engineering and Computer Science, pp. 661-668.
[9] Byrd R, Nocedal J,YuanY.,(1987), Global convergence of a class of quasi-Newton methods on convex problems. SIAM J. Numer Anal, 1171-1189.
[10] Chen L.H., Deng N.Y., and. Zhang J.Z, (2006),’A modified quasi-Newton method for structured optimization with partial information on the Hessian, Comput. Optim. Appl. 35, pp. 5-18.
[11] Dolan E. and Mor´e J.J., (2002), Benchmarking optimization software with performance profiles, Math. Program.,91, pp.201-213.
[12] Hawraz N. Jabba and Basim A. Hassan, (2021), Two-versions of descent conjugate gradient methods for large-scale unconstrained optimization, Indonesian Journal of Electrical Engineering and Computer Science Vol. 22, No. 3, pp. 1643-1649.
[13] Jian H., Zong-Chuan W. and Qing C., (2018), An unconstrained optimization reformulation for the nash game, Journal of Interdisciplinary Mathematics, pp. 1303-1307.
[14] More J., Garbow B., and Hillstrome K., (1981),’ Testing unconstrained optimization software, ACM Trans. Math. Software, 7, pp. 17-41.
[15] Mohd A. H., Mustafa M. and Leong W. J., (2014), ‘ BFGS Method: A New Search Direction ‘, Sains Malaysiana 43(10), pp. 1591–1597.
[16] Pater M. and P. Kaelo, (2019), A convergence modified HS-DY hybrid conjugate gradient method for unconstrained optimization problems. Journal of Information and Optimization Sciences, pp.97-113.
[17] Razieh D., Narges B. & Mohammad M., (2019), A new modified BFGS method for solving systems of nonlinear equations, Journal of Interdisciplinary Mathematics, No. 1, pp. 75-89.
[18] Toint PL (1986) Global convergence of the partioned BFGS algorithm for convex partially separable opertimization. Math Program 36:290–306.
[19] Li D. and Fukushima M.,(2001),’ A modified BFGS method and its global convergence in nonconvex minimization, J. Comp. Appl. Math., pp.15-35.
[20] Wei Z., Li G. and Qi L., (2006),’ New quasi-Newton methods for unconstrained optimization problems. Math. Program. Applied Mathematics and Computation, 175, pp. 1156–1188.
[21] Yuan G, Wei Z (2010) Convergence analysis of a modified BFGS method on convex minimizations. Comput Optim Appl 47:237–255.
[22] Yuan, Y., Sun, W., (1999),’ Theory and Methods of Optimization. Science Press of China, Beijing.
[23] Zhang JZ, Deng NY, Chen LH (1999) New quasi-Newton equation and related methods for unconstrained optimization. J Optim Theory Appl 102:147–167.

Views: 213Downloads: 75Citations: 1