A sufficient descent LS conjugate gradient method for unconstrained optimization problems
From MaRDI portal
Publication:654620
DOI10.1016/J.AMC.2011.06.034zbMATH Open1343.65071OpenAlexW1998295157MaRDI QIDQ654620FDOQ654620
Authors: Min Li, Heying Feng 
Publication date: 29 December 2011
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2011.06.034
Recommendations
- A sufficient descent Liu–Storey conjugate gradient method and its global convergence
- Global convergence of a modified Liu-Storey conjugate gradient method
- Global convergence of a modified LS conjugate gradient method
- The convergence property of a sufficient descent LS-type conjugates gradient method
- Modified nonlinear conjugate gradient method with sufficient descent condition for unconstrained optimization
global convergenceconjugate gradient methodsufficient descent propertystrong Wolfe line searchLiu-Storey method
Cites Work
- CUTE
- Benchmarking optimization software with performance profiles.
- Function minimization by conjugate gradients
- Line search algorithms with guaranteed sufficient decrease
- Title not available (Why is that?)
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Title not available (Why is that?)
- A survey of nonlinear conjugate gradient methods
- A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems
- Convergence of Liu-Storey conjugate gradient method
Cited In (15)
- A modified Perry's conjugate gradient method-based derivative-free method for solving large-scale nonlinear monotone equations
- A derivative-free Liu-Storey method for solving large-scale nonlinear systems of equations
- A sufficient descent Liu–Storey conjugate gradient method and its global convergence
- An Liu-Storey-type method for solving large-scale nonlinear monotone equations
- Title not available (Why is that?)
- The convergence property of a sufficient descent LS-type conjugates gradient method
- A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method
- A study of Liu-Storey conjugate gradient methods for vector optimization
- An efficient hybrid conjugate gradient method for unconstrained optimisation
- Some sufficient descent conjugate gradient methods and their global convergence
- Some new descent nonlinear conjugate gradient methods for unconstrained optimization problems with global convergence
- A three-term conjugate gradient algorithm with restart procedure to solve image restoration problems
- A family of limited memory three term conjugate gradient methods
- A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems
- A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations
Uses Software
This page was built for publication: A sufficient descent LS conjugate gradient method for unconstrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q654620)
