Two effective hybrid conjugate gradient algorithms based on modified BFGS updates

DOI10.1007/s11075-011-9457-6zbMath1277.90149OpenAlexW1974856944MaRDI QIDQ645035

Masoud Fatemi, Saman Babaie-Kafaki, Nezam Mahdavi-Amiri

Publication date: 8 November 2011

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-011-9457-6

zbMATH Keywords

unconstrained optimizationglobal convergencehybrid conjugate gradient algorithmmodified BFGS method

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Methods of reduced gradient type (90C52)

Related Items

A descent hybrid conjugate gradient method based on the memoryless BFGS update ⋮ An efficient hybrid conjugate gradient method with sufficient descent property for unconstrained optimization ⋮ A hybridization of the Hestenes–Stiefel and Dai–Yuan conjugate gradient methods based on a least-squares approach ⋮ Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations ⋮ Two modified scaled nonlinear conjugate gradient methods ⋮ A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods ⋮ Unnamed Item ⋮ A limited memory descent Perry conjugate gradient method ⋮ Two--parameter scaled memoryless BFGS methods with a nonmonotone choice for the initial step length ⋮ A new conjugate gradient method with an efficient memory structure ⋮ Two hybrid nonlinear conjugate gradient methods based on a modified secant equation ⋮ A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function ⋮ A modified Perry conjugate gradient method and its global convergence

Uses Software

• CUTEr
• SifDec

Cites Work

• New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
• A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule
• Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization
• Notes on the Dai-Yuan-Yuan modified spectral gradient method
• Hybrid conjugate gradient algorithm for unconstrained optimization
• New quasi-Newton equation and related methods for unconstrained optimization
• Global convergence result for conjugate gradient methods
• Another hybrid conjugate gradient algorithm for unconstrained optimization
• Optimization theory and methods. Nonlinear programming
• A Modified BFGS Algorithm for Unconstrained Optimization
• A nonlinear conjugate gradient method based on the MBFGS secant condition
• Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
• Two-Point Step Size Gradient Methods
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• Function minimization by conjugate gradients
• CUTEr and SifDec
• The conjugate gradient method in extremal problems
• Methods of conjugate gradients for solving linear systems
• A modified BFGS method and its global convergence in nonconvex minimization
• A spectral conjugate gradient method for unconstrained optimization
• New properties of a nonlinear conjugate gradient method
• Benchmarking optimization software with performance profiles.
• An efficient hybrid conjugate gradient method for unconstrained optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item