A descent hybrid conjugate gradient method based on the memoryless BFGS update
type: Item
instance of: scholarly article
title: A descent hybrid conjugate gradient method based on the memoryless BFGS update
author: Ioannis E. Livieris
author: Vassilis Tampakas
author: Panagiotis Pintelas
published in: Numerical Algorithms
publication date: 2018-11-29T00:00:00Z
Mathematics Subject Classification ID: 65-XX
zbMATH DE Number: 6986853
zbMATH Keywords: unconstrained optimization
zbMATH Keywords: conjugate gradient method
zbMATH Keywords: frobenious norm
zbMATH Keywords: self-scaled memoryless BFGS
zbMATH Keywords: global convergence
describes a project that uses: CUTE
describes a project that uses: tn
describes a project that uses: L-BFGS
describes a project that uses: CUTEr
describes a project that uses: SCALCG
MaRDI profile type: Publication
full work available at URL: s11075-018-0479-1
OpenAlex ID: W2790222781
cites work: Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
cites work: Global and superlinear convergence of a restricted class of self-scaling methods with inexact line searches, for convex functions
cites work: Numerical expirience with a class of self-scaling quasi-Newton algorithms
cites work: Extra updates for the bfgs method∗
cites work: Broyden's quasi-Newton methods for a nonlinear system of equations and unconstrained optimization: a review and open problems
cites work: Comparison of advanced large-scale minimization algorithms for the solution of inverse ill-posed problems
cites work: Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
cites work: Another hybrid conjugate gradient algorithm for unconstrained optimization
cites work: Hybrid conjugate gradient algorithm for unconstrained optimization
cites work: Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization
cites work: Two effective hybrid conjugate gradient algorithms based on modified BFGS updates
cites work: The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
cites work: A hybridization of the Hestenes–Stiefel and Dai–Yuan conjugate gradient methods based on a least-squares approach
cites work: A hybridization of the Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
cites work: Two optimal Dai–Liao conjugate gradient methods
cites work: A class of adaptive dai-liao conjugate gradient methods based on the scaled memoryless BFGS update
cites work: TWO MODIFIED HYBRID CONJUGATE GRADIENT METHODS BASED ON A HYBRID SECANT EQUATION
cites work: CUTE
cites work: A wavelet-based nested iteration-inexact conjugate gradient algorithm for adaptively solving elliptic PDEs
cites work: A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search
cites work: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
cites work: An efficient hybrid conjugate gradient method for unconstrained optimization
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: 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: Global convergence result for conjugate gradient methods
cites work: A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization
cites work: On the limited memory BFGS method for large scale optimization
cites work: Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions
cites work: Efficient generalized conjugate gradient algorithms. I: Theory
cites work: A new conjugate gradient algorithm for training neural networks based on a modified secant equation
cites work: A limited memory descent Perry conjugate gradient method
cites work: Enriched methods for large-scale unconstrained optimization
cites work: Newton-Type Minimization via the Lanczos Method
cites work: Preconditioning of Truncated-Newton Methods
cites work: Updating Quasi-Newton Matrices with Limited Storage
cites work: Q4016506
cites work: Numerical Optimization
cites work: Analysis of a self-scaling quasi-Newton method
cites work: Self-Scaling Variable Metric (SSVM) Algorithms
cites work: Optimal conditioning of self-scaling variable Metric algorithms
cites work: The conjugate gradient method for linear ill-posed problems with operator perturbations
cites work: Q5563083
cites work: Q4107408
cites work: Restart procedures for the conjugate gradient method
cites work: Q3313210
cites work: Iterative accelerating algorithms with Krylov subspaces for the solution to large-scale nonlinear problems
cites work: On the Convergence of a New Conjugate Gradient Algorithm
cites work: Efficient hybrid conjugate gradient techniques
cites work: Conjugate gradient method for rank deficient saddle point problems
cites work: Two descent hybrid conjugate gradient methods for optimization
cites work: Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
cites work: Numerical Experience with Limited-Memory Quasi-Newton and Truncated Newton Methods

A descent hybrid conjugate gradient method based on the memoryless BFGS update (DOI)
DOI: 10.1007/S11075-018-0479-1