Article Per Year (5 Year)
p-Index From 2021 - 2026
0.671
P-Index
This Author published in this journals
All Journal TELKOMNIKA (Telecommunication Computing Electronics and Control) Indonesian Journal of Electrical Engineering and Computer Science
Rana Z. Al-Kawaz
University of Telafer
Computer Science & IT

Published : 3 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 3 Documents
Search

 1 
An effective new iterative CG-method to solve unconstrained non-linear optimization issues Rana Z. Al-Kawaz; Abbas Y. Al-Bayati
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 19, No 6: December 2021
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v19i6.19791

Abstract

In this paper, we proposed a matrix-free double-search direction based on the updated parameter file of the double-search direction with a new mathematical formula for the gamma parameter. When comparing the numerical results of this algorithm with the standard (HWY) algorithm which given by Halilu, Waziri and Yusuf in 2020. We get very robust numerical results. The proposed algorithm is devoid of derivatives to solve large-scale non-linear problems by combining two search directions in one search direction. We demonstrated the overall convergence of the proposed algorithm under certain conditions. The numerical results presented in this paper show that the new search direction is useful for solving widespread non-linear test problems.
Show off the efficiency of dai-liao method in merging technology for monotonous non-linear problems Rana Z. Al-Kawaz; Abbas Y. Al-Bayati
Indonesian Journal of Electrical Engineering and Computer Science Vol 21, No 1: January 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v21.i1.pp505-515

Abstract

In this article, we give a new modification for the Dai-Liao method to solve monotonous nonlinear problems. In our modification, we relied on two important procedures, one of them was the projection method and the second was the method of damping the quasi-Newton condition. The new approach of derivation yields two new parameters for the conjugated gradient direction which, through some conditions, we have demonstrated the sufficient descent property for them. Under some necessary conditions, the new approach achieved global convergence property. Numerical results show how efficient the new approach is when compared with basic similar classic methods.
A fast spectral conjugate gradient method for solving nonlinear optimization problems Ali A. Al-Arbo; Rana Z. Al-Kawaz
Indonesian Journal of Electrical Engineering and Computer Science Vol 21, No 1: January 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v21.i1.pp429-439

Abstract

This paper proposes a new spectral conjugate gradient (SCG) approach for solving unregulated nonlinear optimization problems. Our approach proposes Using Wolfe's rapid line scan to adjust the standard conjugate descent (CD) algorithm. A new spectral parameter is a mixture of new gradient and old search path. The path provided by the modified method provides a path of descent for the solution of objective functions. The updated method fits the traditional CD method if the line check is correct. The stability and global convergence properties of the current new SCG are technically obtained from applying certain well-known and recent mild assumptions. We test our approach with eight recently published CD and SCG methods on 55 optimization research issues from the CUTE library. The suggested and all other algorithms included in our experimental research were implemented in FORTRAN language with double precision arithmetic and all experiments were conducted on a PC with 8 GB ram Processor Intel Core i7. The results indicate that our proposed solution outperforms recently reported algorithms by processing and performing fewer iterations in a shorter time.
Co-Authors Abbas Y. Al-Bayati Ali A. Al-Arbo