Novel preconditioners based on quasi-Newton updates for nonlinear conjugate gradient methods
type: Item
instance of: scholarly article
title: Novel preconditioners based on quasi-Newton updates for nonlinear conjugate gradient methods
zbMATH Open document ID: 1367.90091
author: Caliciotti Andrea
author: Fasano Giovanni
author: Roma Massimo
published in: Optimization Letters
publication date: 2017-04-20T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C06
zbMATH DE Number: 6706502
zbMATH Keywords: approximate inverse preconditioners
zbMATH Keywords: preconditioned nonlinear conjugate gradient
zbMATH Keywords: large scale nonconvex optimization
zbMATH Keywords: quasi-Newton updates
describes a project that uses: SCALCG
describes a project that uses: CUTEst
describes a project that uses: L-BFGS
MaRDI profile type: Publication
full work available at URL: s11590-016-1060-2
OpenAlex ID: W2472474713
cites work: Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
cites work: QN-like variable storage conjugate gradients
cites work: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
cites work: Sizing and Least-Change Secant Methods
cites work: Benchmarking optimization software with performance profiles.
cites work: Iterative computation of negative curvature directions in large scale optimization
cites work: Preconditioning Newton-Krylov methods in nonconvex large scale optimization
cites work: A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization
cites work: Function minimization by conjugate gradients
cites work: Global Convergence Properties of Conjugate Gradient Methods for Optimization
cites work: Q5689624
cites work: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
cites work: On A Class of Limited Memory Preconditioners For Large Scale Linear Systems With Multiple Right-Hand Sides
cites work: A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
cites work: Q5479892
cites work: The Limited Memory Conjugate Gradient Method
cites work: Methods of conjugate gradients for solving linear systems
cites work: On the limited memory BFGS method for large scale optimization
cites work: Automatic Preconditioning by Limited Memory Quasi-Newton Updating
cites work: Line search algorithms with guaranteed sufficient decrease
cites work: A Relationship between the BFGS and Conjugate Gradient Algorithms and Its Implications for New Algorithms
cites work: Updating Quasi-Newton Matrices with Limited Storage
cites work: Q5491447
cites work: Q5563083
cites work: Conjugate gradient algorithms in nonconvex optimization
cites work: Conjugate Gradient Methods with Inexact Searches
DOI: 10.1007/S11590-016-1060-2
description: scientific article; zbMATH DE number 6706502