A globally convergent gradient-like method based on the Armijo line search
Publish place: Journal of Mathematical Modeling، Vol: 9، Issue: 4
Publish Year: 1400
نوع سند: مقاله ژورنالی
زبان: English
View: 60
This Paper With 12 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JMMO-9-4_010
تاریخ نمایه سازی: 19 خرداد 1403
Abstract:
In this paper, a new conjugate gradient-like algorithm is proposed to solve unconstrained optimization problems. The step directions generated by the new algorithm satisfy sufficient descent condition independent of the line search. The global convergence of the new algorithm, with the Armijo backtracking line search, is proved. Numerical experiments indicate the efficiency and robustness of the new algorithm.
Keywords:
Authors
Ahmad Kamandi
Department of Mathematics, University of Science and Technology of Mazandaran, Behshahr, Iran
Keyvan Amini
Department of Mathematics, Razi university, Kermanshah, Iran