Solving unconstrained optimization problems via hybrid CD-DY conjugate gradient methods with applications
type: Item
instance of: scholarly article
title: Solving unconstrained optimization problems via hybrid CD-DY conjugate gradient methods with applications
zbMATH Open document ID: 1480.65145
author: Jitsupa Deepho
author: Auwal Bala Abubakar
author: Maulana Malik
author: Ioannis Konstantinos Argyros
published in: Journal of Computational and Applied Mathematics
publication date: 2022-01-20T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C52
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 7460143
zbMATH Keywords: unconstrained optimization
zbMATH Keywords: hybrid conjugate gradient method
zbMATH Keywords: line search
zbMATH Keywords: global convergence
describes a project that uses: L-BFGS
describes a project that uses: CG_DESCENT
MaRDI profile type: Publication
full work available at URL: j.cam.2021.113823
OpenAlex ID: W3216821690
cites work: Optimization theory and methods. Nonlinear programming
cites work: Q5479892
cites work: A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
cites work: Global Convergence Properties of Conjugate Gradient Methods for Optimization
cites work: Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
cites work: A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
cites work: Algorithm 851
cites work: Convergence Properties of Nonlinear Conjugate Gradient Methods
cites work: Iterative Methods and Their Dynamics with Applications
cites work: Function minimization by conjugate gradients
cites work: Q5563083
cites work: The conjugate gradient method in extremal problems
cites work: Methods of conjugate gradients for solving linear systems
cites work: Q4226179
cites work: Efficient generalized conjugate gradient algorithms. I: Theory
cites work: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
cites work: Hybrid conjugate gradient methods for unconstrained optimization
cites work: Efficient hybrid conjugate gradient techniques
cites work: An efficient hybrid conjugate gradient method for unconstrained optimization
cites work: A simple three-term conjugate gradient algorithm for unconstrained optimization
cites work: New hybrid conjugate gradient method for unconstrained optimization
cites work: A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method
cites work: A modified Hestense–Stiefel conjugate gradient method close to the memoryless BFGS quasi-Newton method
cites work: A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function
cites work: A modified BFGS method and its global convergence in nonconvex minimization
cites work: Updating Quasi-Newton Matrices with Limited Storage
cites work: Conjugate Gradient Methods with Inexact Searches
cites work: Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions
cites work: Nonlinear conjugate gradient methods for unconstrained optimization
cites work: A literature survey of benchmark functions for global optimisation problems
cites work: Some three-term conjugate gradient methods with the inexact line search condition
cites work: Benchmarking optimization software with performance profiles.
cites work: Q4821321
cites work: A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection
DOI: 10.1016/J.CAM.2021.113823
description: scientific article; zbMATH DE number 7460143