An asymptotically optimal gradient algorithm for quadratic optimization with low computational cost

DOI10.1007/S11590-012-0491-7MaRDI QIDQ360475zbMATH OpenOpenAlexFDO

Authors Luc Pronzato, Elena Bukina, A. Zhigljavsky

Publication date 27 August 2013

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-012-0491-7

zbMATH Keywords

conjugate gradientquadratic optimizationFibonacci numbersarcsine distributionestimation of leading eigenvaluesgradient algorithms

Mathematics Subject Classification ID

Quadratic programming (90C20) Methods of reduced gradient type (90C52)

Recommendations

• Gradient algorithms for quadratic optimization with fast convergence rates
• Studying convergence of gradient algorithms via optimal experimental design theory
• New stepsizes for the gradient method
• Near optimal step size and momentum in gradient descent for quadratic functions
• A Dynamical-System Analysis of the Optimum s-Gradient Algorithm

Cites work

• scientific article; zbMATH DE number 3284416 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• A Dynamical-System Analysis of the Optimum s-Gradient Algorithm
• Asymptotic behaviour of a family of gradient algorithms in \(\mathbb R^{ d }\) and Hilbert spaces
• Efficient and reliable iterative methods for linear systems
• Gradient algorithms for quadratic optimization with fast convergence rates
• Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
• Studying convergence of gradient algorithms via optimal experimental design theory
• The block preconditioned conjugate gradient method on vector computers
• Two-Point Step Size Gradient Methods

Cited in

(8)

• Performance analysis of greedy algorithms for minimising a maximum mean discrepancy
• Studying convergence of gradient algorithms via optimal experimental design theory
• On \(R\)-linear convergence analysis for a class of gradient methods
• On the steplength selection in gradient methods for unconstrained optimization
• Delayed gradient methods for symmetric and positive definite linear systems
• Gradient algorithms for quadratic optimization with fast convergence rates
• Spectral properties of Barzilai-Borwein rules in solving singly linearly constrained optimization problems subject to lower and upper bounds
• Estimation of spectral bounds in gradient algorithms

This page was built for publication: An asymptotically optimal gradient algorithm for quadratic optimization with low computational cost

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q360475)