DEVELOPMENT OF THE HESTENES AND STEIFEL ALGORITHM TO SOLVE UNCONSTRAINED OPTIMIZATION

المؤلفون

  • Basim Hassan Department of Mathematics, College of Computers Sciences and Mathematics University of Mosul, IRAQ
  • Ali AL-Issa Department of Mathematics, College of Computers Sciences and Mathematics University of Aleppo, Syria

DOI:

https://doi.org/10.59743/aujas.v5i1.1660

الكلمات المفتاحية:

Unconstrained Optimization، Conjugate Gradient، Conjugate Coefficient، Global Convergence

الملخص

In this paper we present the development of the algorithm  the Hestenes and Steifel (HS),that will be through suggest conjugate  coefficient,  then  analyzing,  studying  the  convergence  of  the  suggested  algorithm  and  proving  the  sufficient  descent  condition  and  global  convergence.  The  numerical  results  have  shown  the  effectiveness of the suggested algorithm after applying it on a group  of standard tests problems 

المراجع

Y. Salih, M A .Hamoda, Sukono, M .Mamat, The convergence properties of new hybrid conjugate gradient method, Materials Science and Engineering 567 (2019) 012031 doi:10.1088/1757-899X/567/1/012031. DOI: https://doi.org/10.1088/1757-899X/567/1/012031

P. Wolfe, Convergence conditions for ascent method, SIAM Rev 11 (1969) 226–235. DOI: https://doi.org/10.1137/1011036

Y. Salih, , M. Hamoda, M. Rivaie, 2018- New Hybrid Conjugate Gradient Method with Global Convergence Properties for Unconstrained Optimization, Malaysian Journal of Computing and Applied Mathematics, Vol .1,No1- pp.29- 38.

M.R. Hestenes, E. Steifel, Method of conjugate gradient for solving linear equations, J. Res. Nat. Bur. Stand 49 (1952) 409–436. DOI: https://doi.org/10.6028/jres.049.044

R. FLETCHER, C. REEVES , 1964- Function Minimization by Conjugate Gradients, the Computer Journal, Vol. 7, No. 2, pp.149-154. DOI: https://doi.org/10.1093/comjnl/7.2.149

E. Polak and G. Ribiére , Note Sur la Convergence de Méthodes de Directions Conjuguées, Revue Françoise d’Informatique et de Recherché Opérationnelle, Vol.16, No.3, pp. 35–43. DOI: https://doi.org/10.1051/m2an/196903R100351

B. T. Polyak, The conjugate gradient method in extreme problems, USSR Computational Mathematics and Mathematical Physics, 9 (1969), 94-112. DOI: https://doi.org/10.1016/0041-5553(69)90035-4

M. Miladinovic, P. Stanimirovic. and S. Miljkovic , Scalar Correction Method for Solving Large Scale Unconstrained Minimization Problems. Springer Science Bussiness Media, 151(2011) 304-320. DOI: https://doi.org/10.1007/s10957-011-9864-9

M. Hamoda, M. Mamat, M. Rivaie, Z. Salleh, , A Conjugate Gradient Method with Strong Wolfe-Powell Line Search for Unconstrained Optimization, Applied Mathematical Sciences, Vol. 10, No. 15, pp.721 – 734.2016. DOI: https://doi.org/10.12988/ams.2016.56449

Development of the Hestenes and Steifel Algorithm to Solve Unconstrained Optimization

M. Al-Baali, Descent Property and Global Convergence of the Fletcher- Reeves Method with Inexact Line-Search, IMA Journal of Numerical Analysis, 5(1985), 121–124. DOI: https://doi.org/10.1093/imanum/5.1.121

Y.H. Dai, Y. Yuan, A nonlinear conjugate gradient with a strong global convergence property, SIAM J. Optim. 10 (1999) 177–182. DOI: https://doi.org/10.1137/S1052623497318992

N. Andrei, An unconstrained optimization test functions collection, Adv. Modell. Optim. 10 (2008) 147–161.

التنزيلات

منشور

30-06-2020

كيفية الاقتباس

Hassan , B., & AL-Issa, A. (2020). DEVELOPMENT OF THE HESTENES AND STEIFEL ALGORITHM TO SOLVE UNCONSTRAINED OPTIMIZATION . مجلة الجامعة الأسمرية, 5(1), 134–144. https://doi.org/10.59743/aujas.v5i1.1660