A New Hybrid Conjugate Gradient Method Based on Eigenvalue Analysis for Unconstrained Optimization Problems
Publish Year: 1397
Type: Journal paper
Language: English
View: 210
This Paper With 18 Page And PDF Format Ready To Download
- Certificate
- I'm the author of the paper
Export:
Document National Code:
JR_COAM-3-1_002
Index date: 19 February 2023
A New Hybrid Conjugate Gradient Method Based on Eigenvalue Analysis for Unconstrained Optimization Problems abstract
In this paper, two extended three-term conjugate gradient methods based on the Liu-Storey ({\tt LS}) conjugate gradient method are presented to solve unconstrained optimization problems. A remarkable property of the proposed methods is that the search direction always satisfies the sufficient descent condition independent of line search method, based on eigenvalue analysis. The global convergence of proposed algorithms is established under suitable conditions. Preliminary numerical results show that the proposed methods are efficient and robust to solve the unconstrained optimization problems.
A New Hybrid Conjugate Gradient Method Based on Eigenvalue Analysis for Unconstrained Optimization Problems Keywords:
A New Hybrid Conjugate Gradient Method Based on Eigenvalue Analysis for Unconstrained Optimization Problems authors
Farzad Rahpeymaii
Department of Mathematics, Payame Noor University, PO BOX ۱۹۳۹۵-۳۶۹۷, Tehran, Iran
majid rostami
Young Researchers and Elite Club‎, ‎Hamedan Branch‎, ‎Islamic Azad University‎, ‎Hamedan‎, ‎Iran
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :