A Modified  estimation for the steplenght of a descent nonlinear algorithm

Y. AL-Bayati, Abbas; Ivan Subhi Latif, And

doi:10.32894/kujss.2009.39976

A Modified estimation for the steplenght of a descent nonlinear algorithm

Authors

Abbas Y. AL-Bayati

and Ivan Subhi Latif

10.32894/kujss.2009.39976

Abstract

In this paper, we have presented a numerical algorithm for the step-size estimation for minimization problems. Global convergence results are derived for descent algorithms in which the line search step is replaced by a step whose length is determined by step-size estimation formula. Numerical results show that the new estimation step-size required less storage and greatly speeded up the convergence of the gradient algorithm for large-scale unconstrained optimization problems. Also the new proposed algorithm seems to converge better and superior to other similar algorithms in many situations.

Keywords

A Modified

Estimation

the steplenght

a descent

nonlinear

algorithm

{"scholar_in_index":0,"scholar_link":"https://scholar.google.com/scholar?q=%2210.32894%2Fkujss.2009.39976%22&hl=en&num=10","scholar_title":"","scholar_cited_by":"","scholar_checked_at":"2026-07-09 11:06:32"}