article · Statistics Optimization & Information Computing
We are interested in the performance of nonlinear conjugate gradient methods for unconstrained optimization. Inparticular, we address the conjugate gradient algorithm with strong Wolfe inexact line search. Firstly, we study the descentproperty of the search direction of the considered conjugate gradient algorithm based on a new direction obtained from anew parameter. The main objective of this parameter is to improve the speed of the convergence of the obtained algorithm.Then, we present a complete study that shows the global convergence of this algorithm. Finally, we establish comparativenumerical experiments on well-known test examples to show the efficiency and robustness of our algorithm compared toother recent algorithms.
This page summarises published work. The authoritative version sits with the publisher.
DOI: 10.19139/soic-2310-5070-2069
Is something wrong with this record? Report it or request removal.
Discussion
Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.
No discussion yet. Open the first thread.
New to MARATTO™? Create a free account.