A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function

DOI10.1007/s40314-019-0973-7zbMath1438.90270OpenAlexW2980067177WikidataQ127111056 ScholiaQ127111056MaRDI QIDQ2327437

Zahra Khoshgam, Ali Reza Ashrafi

Publication date: 14 October 2019

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-019-0973-7

zbMATH Keywords

unconstrained optimizationglobal convergencelarge-scale optimizationsecant equationhybrid conjugate gradient method

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Related Items (5)

A hybrid conjugate gradient based approach for solving unconstrained optimization and motion control problems ⋮ A hybrid HS-LS conjugate gradient algorithm for unconstrained optimization with applications in motion control and image recovery ⋮ An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction ⋮ A new hybrid PRPFR conjugate gradient method for solving nonlinear monotone equations and image restoration problems ⋮ Solving unconstrained optimization problems via hybrid CD-DY conjugate gradient methods with applications

Uses Software

• CUTEr

Cites Work

• Unnamed Item
• Unnamed Item
• A modified scaled conjugate gradient method with global convergence for nonconvex functions
• Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization
• New quasi-Newton methods via higher order tensor models
• Two effective hybrid conjugate gradient algorithms based on modified BFGS updates
• Efficient generalized conjugate gradient algorithms. I: Theory
• 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
• New quasi-Newton equation and related methods for unconstrained optimization
• The superlinear convergence of a modified BFGS-type method for unconstrained optimization
• Global convergence properties of nonlinear conjugate gradient methods with modified secant condition
• Another hybrid conjugate gradient algorithm for unconstrained optimization
• New quasi-Newton methods for unconstrained optimization problems
• Optimization theory and methods. Nonlinear programming
• Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition
• A Modified BFGS Algorithm for Unconstrained Optimization
• A nonlinear conjugate gradient method based on the MBFGS secant condition
• Convergence Properties of Nonlinear Conjugate Gradient Methods
• 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
• Benchmarking optimization software with performance profiles.
• An efficient hybrid conjugate gradient method for unconstrained optimization

This page was built for publication: A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function