Developing a new conjugate gradient algorithm with the benefit of some desirable properties of the Newton algorithm for unconstrained optimization
type: Item
instance of: scholarly article
title: Developing a new conjugate gradient algorithm with the benefit of some desirable properties of the Newton algorithm for unconstrained optimization
DOI: 10.11948/20230268
author: Naima Hamel
author: Noureddine Benrabia
author: Mourad Ghiat
author: Hamza Guebbai
published in: Journal of Applied Analysis and Computation
publication date: 2024-10-08T00:00:00Z
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 49M15
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 7922850
zbMATH Keywords: uconstraind optimization
zbMATH Keywords: conjugate gradient algorithm
zbMATH Keywords: Newton method
zbMATH Keywords: quadratic convergence behavior
zbMATH Keywords: global convergence
MaRDI profile type: Publication
cites work: A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection
cites work: A hybrid conjugate gradient based approach for solving unconstrained optimization and motion control problems
cites work: Another hybrid conjugate gradient algorithm for unconstrained optimization
cites work: Q3539529
cites work: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
cites work: New hybrid conjugate gradient method as a convex combination of LS and FR methods
cites work: Benchmarking optimization software with performance profiles.
cites work: Q4226179
cites work: Function minimization by conjugate gradients
cites work: Global Convergence Properties of Conjugate Gradient Methods for Optimization
cites work: Methods of conjugate gradients for solving linear systems
cites work: The proof of the sufficient descent condition of the Wei-Yao-Liu conjugate gradient method under the strong Wolfe-Powell line search
cites work: New hybrid conjugate gradient method for unconstrained optimization
cites work: Efficient generalized conjugate gradient algorithms. I: Theory
cites work: Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing
cites work: A Linear Hybridization of Dai-Yuan and Hestenes-Stiefel Conjugate Gradient Method for Unconstrained Optimization
cites work: Implicit steepest descent algorithm for optimization with orthogonality constraints
cites work: Q5563083
cites work: The conjugate gradient method in extremal problems
cites work: Newton's method and its use in optimization
cites work: A Noise-Tolerant Quasi-Newton Algorithm for Unconstrained Optimization
cites work: The convergence properties of some new conjugate gradient methods
cites work: A nonmonotone gradient method for constrained multiobjective optimization problems
description: scientific article; zbMATH DE number 7922850