Descent three-term conjugate gradient methods based on secant conditions for unconstrained optimization

DOI10.1080/10556788.2017.1338288MaRDI QIDQ4594858zbMATH OpenOpenAlexFDO

Authors Hiroshi Kobayashi, Yasushi Narushima, Hiroshi Yabe

Publication date 24 November 2017

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2017.1338288

zbMATH Keywords

global convergencesecant conditionsufficient descent propertythree-term conjugate gradient methodunconstrained optimization

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Recommendations

• Three-term conjugate gradient methods based on secant conditions for unconstrained optimization
• Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
• A new three-term conjugate gradient method with descent direction for unconstrained optimization
• A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
• A convergent hybrid three-term conjugate gradient method with sufficient descent property for unconstrained optimization

Cited in

(13)

• Guaranteed descent conjugate gradient methods with modified secant condition
• Two descent Dai-Yuan conjugate gradient methods for systems of monotone nonlinear equations
• Adaptive three-term family of conjugate residual methods for system of monotone nonlinear equations
• Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing
• A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization
• Three-term conjugate gradient methods based on secant conditions for unconstrained optimization
• Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
• Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization
• Global convergence of a new sufficient descent spectral three-term conjugate gradient class for large-scale optimization
• Memoryless quasi-Newton methods based on the spectral-scaling Broyden family for Riemannian optimization
• Three-term Hager-Zhang projection method for monotone nonlinear equations
• A class of new subspace minimization conjugate gradient algorithms for unconstrained optimization
• An improved PRP conjugate gradient algorithm with a damping factor within an automatic restarting strategy

This page was built for publication: Descent three-term conjugate gradient methods based on secant conditions for unconstrained optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4594858)