Performance of New Line Search Methods with Three-Term Hybrid Descent Approach for Unconstrained Optimization Problems
Asian Research Journal of Mathematics · pp. 36–46 · Published 26 Feb 2022
10.9734/arjom/2022/v18i230358Abstract
In this paper, l demonstrates the performance and efficiency of new line search methods with three-term hybrid descent method for the solution of unconstrained optimization problems (UOPs). The techniques advanced the sustainable range of step-length to a broader level than the previous studies and gave a suitable initial step-length at each step of the iterations. The global convergence rate of the new line with three-term hybrid descent method search is carried studied. Some numerical results through performance profile shows that among the new search method modified Wolfe line search method in CPU time and iterations is best in practical computation.
Cited by 1
G. Al-Naemi, Samaa Al-bakri · Al-Rafidain Journal of Computer Sciences and Mathematics · 2023
Related research
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
1
Citations
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
No views recorded yet.
Traffic sources
Referring site, by host.
No traffic recorded yet.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.