Fast gradient methods with alignment for symmetric linear systems without using Cauchy step

DOI10.1016/j.cam.2020.113033zbMath1452.65064arXiv1909.01479OpenAlexW3037462367MaRDI QIDQ2195925

Frédéric Magoulès, Qinmeng Zou

Publication date: 28 August 2020

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.01479

zbMATH Keywords

linear systemsspectral analysisasymptotically optimalgradient methods with alignmentminimal gradient

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Approximation to limiting values (summation of series, etc.) (40A25)

Related Items (4)

Unifying relations between iterative linear equation solvers and explicit Euler approximations for associated parabolic regularized equations ⋮ Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems ⋮ A gradient method exploiting the two dimensional quadratic termination property ⋮ On \(R\)-linear convergence analysis for a class of gradient methods

Uses Software

• SparseMatrix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the regularizing behavior of the SDA and SDC gradient methods in the solution of linear ill-posed problems
• The chaotic nature of faster gradient descent methods
• An efficient gradient method using the Yuan steplength
• On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method
• Gradient methods with adaptive step-sizes
• New adaptive stepsize selections in gradient methods
• Smooth and adaptive gradient method with retards
• On the behavior of the gradient norm in the steepest descent method
• On Euler-extrapolated Hermitian/skew-Hermitian splitting method for complex symmetric linear systems
• Analysis of monotone gradient methods
• On semi-convergence of parameterized SHSS method for a class of singular complex symmetric linear systems
• Asymptotic behaviour of a family of gradient algorithms in \(\mathbb R^{ d }\) and Hilbert spaces
• A new gradient method with an optimal stepsize property
• On the asymptotic directions of the s-dimensional optimum gradient method
• Preconditioned Barzilai-Borwein method for the numerical solution of partial differential equations
• R-linear convergence of the Barzilai and Borwein gradient method
• On spectral properties of steepest descent methods
• The university of Florida sparse matrix collection
• Gradient Methods for Large Scale Convex Quadratic Functions
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Two-Point Step Size Gradient Methods
• Some remarks on the method of minimal residues
• Solution of Sparse Indefinite Systems of Linear Equations
• Gradient Method with Retards and Generalizations
• Alternate minimization gradient method
• Alternate step gradient method*
• On Euler preconditioned SHSS iterative method for a class of complex symmetric linear systems
• Gradient descent and fast artificial time integration
• On the Barzilai and Borwein choice of steplength for the gradient method
• The cyclic Barzilai-–Borwein method for unconstrained optimization
• Methods of conjugate gradients for solving linear systems
• Relaxed steepest descent and Cauchy-Barzilai-Borwein method
• On the steepest descent algorithm for quadratic functions

This page was built for publication: Fast gradient methods with alignment for symmetric linear systems without using Cauchy step