In this paper, we propose a three–term PRP–type conjugate gradient method which always satisfies the sufficient descent condition independently of line searches employed. An important property of our method is that its direction is closest to the direction of the Newton method or satisfies conjugacy condition as the iterations evolve. In addition, under mild condition, we prove global convergence properties of the proposed method. Numerical comparison illustrates that our proposed method is efficient for solving the optimization problems.
Dong, X., Liu, H., He, Y., Babaie-Kafaki, S., & Ghanbari, R. (2016). A New Three–Term Conjugate Gradient Method with Descent Direction for Unconstrained Optimization. Mathematical Modelling and Analysis, 21(3), 399-411. https://doi.org/10.3846/13926292.2016.1176965
Authors who publish with this journal agree to the following terms
that this article contains no violation of any existing copyright or other third party right or any material of a libelous, confidential, or otherwise unlawful nature, and that I will indemnify and keep indemnified the Editor and THE PUBLISHER against all claims and expenses (including legal costs and expenses) arising from any breach of this warranty and the other warranties on my behalf in this agreement;
that I have obtained permission for and acknowledged the source of any illustrations, diagrams or other material included in the article of which I am not the copyright owner.
on behalf of any co-authors, I agree to this work being published in the above named journal, Open Access, and licenced under a Creative Commons Licence, 4.0 https://creativecommons.org/licenses/by/4.0/legalcode. This licence allows for the fullest distribution and re-use of the work for the benefit of scholarly information.
For authors that are not copyright owners in the work (for example government employees), please contact VILNIUS TECHto make alternative agreements.
