Abbas Y. Al-Bayati
University of Telafer

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

Found 3 Documents
Search

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 generalized Dai-Liao type CG-method with a new monotone line search for unconstrained optimization Rana Z. Al-Kawaz; Abbas Y. Al-Bayati
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 21, No 3: June 2023
Publisher : Universitas Ahmad Dahlan

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

Abstract

In this paper, we presented two developments, the first deals with generalizing the modernization of the damped Dai-Liao formula in an optimized manner. The second development is by suggesting a monotone line search formula for our new algorithms. These new algorithms with the new monotone line search yielded good numerical results when compared to the standard Dai-Liao (DL) and minimum description length (MDL) algorithms. Through several theorems, the new algorithms proved to have a faster convergence to reach the optimum point. These comparisons are drawn in the results section for the tools (Iter, Eval-F, Time) which are a comprehensive measure of the efficiency of the new algorithms with the basic algorithms that we used in the paper.