A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization
type: Item
instance of: scholarly article
title: A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization
zbMATH Open document ID: 1492.65170
author: Harry Oviedo
author: R. Andreani
author: M. Raydan
published in: Numerical Algorithms
publication date: 2022-06-13T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 7540335
zbMATH Keywords: gradient methods
zbMATH Keywords: conjugate gradient methods
zbMATH Keywords: strictly convex quadratics
zbMATH Keywords: unconstrained optimization
zbMATH Keywords: Moreau envelope
describes a project that uses: SparseMatrix
MaRDI profile type: MaRDI publication profile
full work available at URL: s11075-021-01228-0
OpenAlex ID: W3216375106
cites work: Properties of the delayed weighted gradient method
cites work: Two-Point Step Size Gradient Methods
cites work: Q4395370
cites work: Hybrid procedures for solving linear systems
cites work: Stabilized Barzilai-Borwein Method
cites work: On the asymptotic behaviour of some new gradient methods
cites work: A family of spectral gradient methods for optimization
cites work: The university of Florida sparse matrix collection
cites work: On spectral properties of steepest descent methods
cites work: An efficient gradient method using the Yuan steplength
cites work: On the steplength selection in gradient methods for unconstrained optimization
cites work: Q5702604
cites work: A limited memory steepest descent method
cites work: New adaptive stepsize selections in gradient methods
cites work: Gradient Method with Retards and Generalizations
cites work: On the steepest descent algorithm for quadratic functions
cites work: Methods of conjugate gradients for solving linear systems
cites work: Gradient methods exploiting spectral properties
cites work: Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
cites work: An efficient gradient method with approximate optimal stepsize for the strictly convex quadratic minimization problem
cites work: Q3688092
cites work: Q5723437
cites work: Proximité et dualité dans un espace hilbertien
cites work: On the behavior of the gradient norm in the steepest descent method
cites work: Q5491447
cites work: A delayed weighted gradient method for strictly convex quadratic minimization
cites work: A hybrid gradient method for strictly convex quadratic programming
cites work: Proximal mappings and Moreau envelopes of single-variable convex piecewise cubic functions and multivariable gauge functions
cites work: The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
cites work: Forward-backward quasi-Newton methods for nonsmooth optimization problems
cites work: Q4337625
cites work: Q5488734
cites work: Gradient methods with adaptive step-sizes
DOI: 10.1007/S11075-021-01228-0
description: scientific article; zbMATH DE number 7540335