A modified HZ conjugate gradient algorithm without gradient Lipschitz continuous condition for non convex functions
type: Item
instance of: scholarly article
title: A modified HZ conjugate gradient algorithm without gradient Lipschitz continuous condition for non convex functions
zbMATH Open document ID: 1502.65035
author: Ailun Jian
author: Mengxiang Zhang
author: Jiajia Yu
author: Gonglin Yuan
published in: Journal of Applied Mathematics and Computing
publication date: 2022-12-13T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C52
zbMATH DE Number: 7632366
zbMATH Keywords: non-convex functions
zbMATH Keywords: sufficient descent
zbMATH Keywords: trust region
zbMATH Keywords: inexact line search
zbMATH Keywords: global convergence
describes a project that uses: SCALCG
describes a project that uses: CG_DESCENT
MaRDI profile type: Publication
full work available at URL: s12190-022-01724-z
OpenAlex ID: W4293100925
cites work: Scaled conjugate gradient algorithms for unconstrained optimization
cites work: A spectral conjugate gradient method for unconstrained optimization
cites work: Convergence Properties of the BFGS Algoritm
cites work: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
cites work: Q4226179
cites work: Function minimization by conjugate gradients
cites work: A globally convergent version of the Polak-Ribière conjugate gradient method
cites work: Global Convergence Properties of Conjugate Gradient Methods for Optimization
cites work: Methods of conjugate gradients for solving linear systems
cites work: A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
cites work: Algorithm 851
cites work: A method for the solution of certain non-linear problems in least squares
cites work: A class of derivative-free methods for large-scale nonlinear monotone equations
cites work: Efficient generalized conjugate gradient algorithms. I: Theory
cites work: A conjugate gradient algorithm under Yuan-Wei-Lu line search technique for large-scale minimization optimization models
cites work: Q5618030
cites work: A class of parameter estimation methods for nonlinear Muskingum model using hybrid invasive weed optimization algorithm
cites work: The conjugate gradient method in extremal problems
cites work: Q4083217
cites work: Convergence Properties of Algorithms for Nonlinear Optimization
cites work: Q3313210
cites work: Q5563083
cites work: A novel parameter estimation method for muskingum model using new Newton-type trust region algorithm
cites work: An effective adaptive trust region algorithm for nonsmooth minimization
cites work: A new adaptive trust region algorithm for optimization problems
cites work: An adaptive trust region algorithm for large-residual nonsmooth least squares problems
cites work: The convergence properties of some new conjugate gradient methods
cites work: Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
cites work: A modified PRP conjugate gradient method
cites work: A new trust-region method with line search for solving symmetric nonlinear equations
cites work: A conjugate gradient method with descent direction for unconstrained optimization
cites work: BFGS trust-region method for symmetric nonlinear equations
cites work: A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
cites work: A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
cites work: Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
cites work: The projection technique for two open problems of unconstrained optimization problems
cites work: The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions
cites work: A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations
cites work: Q4103338
cites work: A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
cites work: Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
DOI: 10.1007/S12190-022-01724-Z
description: scientific article; zbMATH DE number 7632366