A modified scaled conjugate gradient method with global convergence for nonconvex functions

Publication date: 17 October 2014

Published in: Bulletin of the Belgian Mathematical Society - Simon Stevin (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.bbms/1407765884

zbMATH Keywords

unconstrained optimization global convergence conjugate gradient algorithm secant equation descent condition

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53) Numerical methods based on nonlinear programming (49M37) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (15)

A modified scaling parameter for the memoryless BFGS updating formula ⋮ On optimality of the parameters of self-scaling memoryless quasi-Newton updating formulae ⋮ An accelerated descent CG algorithm with clustering the eigenvalues for large-scale nonconvex unconstrained optimization and its application in image restoration problems ⋮ An Accelerated Three-Term Extension of a Descent Nonlinear Conjugate Gradient Method ⋮ A class of spectral three-term descent Hestenes-Stiefel conjugate gradient algorithms for large-scale unconstrained optimization and image restoration problems ⋮ A New Adaptive Conjugate Gradient Algorithm for Large-Scale Unconstrained Optimization ⋮ A class of new three-term descent conjugate gradient algorithms for large-scale unconstrained optimization and applications to image restoration problems ⋮ A restart scheme for the memoryless BFGS method ⋮ A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem ⋮ A new modified scaled conjugate gradient method for large-scale unconstrained optimization with non-convex objective function ⋮ An adaptive conjugate gradient algorithm for large-scale unconstrained optimization ⋮ Two--parameter scaled memoryless BFGS methods with a nonmonotone choice for the initial step length ⋮ Modified Newton integration algorithm with noise suppression for online dynamic nonlinear optimization ⋮ A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function ⋮ Diagonally scaled memoryless quasi-Newton methods with application to compressed sensing

This page was built for publication: A modified scaled conjugate gradient method with global convergence for nonconvex functions