Global convergence of a modified LS method
From MaRDI portal
Summary: The LS method is one of the effective conjugate gradient methods in solving the unconstrained optimization problems. The paper presents a modified LS method on the basis of the famous LS method and proves the strong global convergence for the uniformly convex functions and the global convergence for general functions under the strong Wolfe line search. The numerical experiments show that the modified LS method is very effective in practice.
Recommendations
- Global convergence of a modified LS conjugate gradient method
- Global convergence of a modified Liu-Storey conjugate gradient method
- scientific article; zbMATH DE number 5583980
- A global convergence of LS-CD hybrid conjugate gradient method
- Global convergence of a modified HS conjugate gradient method
Cites work
- A descent nonlinear conjugate gradient method for large-scale unconstrained optimization
- Convergence Properties of Nonlinear Conjugate Gradient Methods
- Efficient generalized conjugate gradient algorithms. I: Theory
- scientific article; zbMATH DE number 5846393 (Why is no real title available?)
- scientific article; zbMATH DE number 4141383 (Why is no real title available?)
- scientific article; zbMATH DE number 2063453 (Why is no real title available?)
- Testing Unconstrained Optimization Software
Cited in
(6)- A global convergence of LS-CD hybrid conjugate gradient method
- Global convergence of a modified conjugate gradient method
- Global convergence of a modified LS conjugate gradient method
- Global convergence of a modified Liu-Storey conjugate gradient method
- scientific article; zbMATH DE number 6179208 (Why is no real title available?)
- scientific article; zbMATH DE number 5583980 (Why is no real title available?)
This page was built for publication: Global convergence of a modified LS method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1955336)