Globally convergent conjugate gradient algorithms without the Lipschitz condition for nonconvex optimization

DOI10.3934/jimo.2022257zbMath1524.90264OpenAlexW4313242513MaRDI QIDQ6175333

Gong Lin Yuan, Hongtruong Pham, Xiaoxuan Chen, Yingjie Zhou

Publication date: 21 July 2023

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2022257

zbMATH Keywords

global convergenceconjugate gradientnon-Lipschitz conditionsufficient descenttrust region feature

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A conjugate gradient method with descent direction for unconstrained optimization
• New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems
• The convergence properties of some new conjugate gradient methods
• Efficient generalized conjugate gradient algorithms. I: Theory
• Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
• A modified PRP conjugate gradient method
• A globally convergent version of the Polak-Ribière conjugate gradient method
• A new hybrid PRPFR conjugate gradient method for solving nonlinear monotone equations and image restoration problems
• A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems
• Adaptive scaling damped BFGS method without gradient Lipschitz continuity
• The global convergence of the BFGS method with a modified WWP line search for nonconvex functions
• Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions
• Some modified Hestenes-Stiefel conjugate gradient algorithms with application in image restoration
• A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations
• Scaled conjugate gradient algorithms for unconstrained optimization
• Convergence Properties of Algorithms for Nonlinear Optimization
• Algorithm 851
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Convergence Properties of the BFGS Algoritm
• Convergence properties of the Fletcher-Reeves method
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• Function minimization by conjugate gradients
• The conjugate gradient method in extremal problems
• Methods of conjugate gradients for solving linear systems
• A spectral conjugate gradient method for unconstrained optimization

This page was built for publication: Globally convergent conjugate gradient algorithms without the Lipschitz condition for nonconvex optimization