Global convergence of a descent PRP type conjugate gradient method for nonconvex optimization
type: Item
instance of: scholarly article
title: Global convergence of a descent PRP type conjugate gradient method for nonconvex optimization
zbMATH Open document ID: 1484.65122
author: Hongrun Zhang
author: Yu Chen
author: Qingjie Hu
published in: Applied Numerical Mathematics
publication date: 2022-02-03T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C52
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 7468856
zbMATH Keywords: nonconvex unconstrained optimization
zbMATH Keywords: Wolfe line search
zbMATH Keywords: Armijo line search
zbMATH Keywords: sufficient descent condition
zbMATH Keywords: global convergence
MaRDI profile type: Publication
full work available at URL: j.apnum.2021.11.001
OpenAlex ID: W3214140244
cites work: A modified descent Polak-Ribiére-Polyak conjugate gradient method with global convergence property for nonconvex functions
cites work: Q3539529
cites work: A conjugate gradient algorithm and its applications in image restoration
cites work: Smoothing Nonlinear Conjugate Gradient Method for Image Restoration Using Nonsmooth Nonconvex Minimization
cites work: New conjugacy conditions and related nonlinear conjugate gradient methods
cites work: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
cites work: Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property
cites work: A modified Perry's conjugate gradient method-based derivative-free method for solving large-scale nonlinear monotone equations
cites work: A three-term conjugate gradient algorithm for large-scale unconstrained optimization problems
cites work: An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems
cites work: Benchmarking optimization software with performance profiles.
cites work: A modified nonlinear Polak-Ribière-Polyak conjugate gradient method with sufficient descent property
cites work: Q4226179
cites work: Function minimization by conjugate gradients
cites work: Global Convergence Properties of Conjugate Gradient Methods for Optimization
cites work: A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
cites work: Q5479892
cites work: Methods of conjugate gradients for solving linear systems
cites work: A new nonmonotone line search technique for unconstrained optimization
cites work: A sufficient descent Dai-Yuan type nonlinear conjugate gradient method for unconstrained optimization problems
cites work: Two modified nonlinear conjugate gradient methods with disturbance factors for unconstrained optimization
cites work: Q5499095
cites work: A gradient‐type iterative method for impulse noise removal
cites work: Efficient generalized conjugate gradient algorithms. I: Theory
cites work: Q5491447
cites work: The conjugate gradient method in extremal problems
cites work: The convergence properties of some new conjugate gradient methods
cites work: Smoothing strategy along with conjugate gradient algorithm for signal reconstruction
cites work: A descent spectral conjugate gradient method for impulse noise removal
cites work: Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
cites work: A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations
cites work: An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation
cites work: A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
DOI: 10.1016/J.APNUM.2021.11.001
description: scientific article; zbMATH DE number 7468856