Limited memory gradient methods for unconstrained optimization

DOI10.1007/S11075-024-01895-9MaRDI QIDQ6983215zbMATH OpenFDO

Authors Giulia Ferrandi, M. E. Hochstenbach

Publication date 15 May 2025

Published in Numerical Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

unconstrained optimizationLyapunov equationsecant conditionlimited memory steepest descentlow-dimensional Hessian approximationRayleigh-Ritz extraction

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Nonlinear programming (90C30)

Cites work

• scientific article; zbMATH DE number 4147424 (Why is no real title available?)
• scientific article; zbMATH DE number 1049353 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• A Limited Memory Algorithm for Bound Constrained Optimization
• A Nonmonotone Line Search Technique for Newton’s Method
• A harmonic framework for stepsize selection in gradient methods
• A limited memory steepest descent method
• A new steplength selection for scaled gradient methods with application to image deblurring
• A note on harmonic Ritz values and their reciprocals
• A scaled gradient projection method for constrained image deblurring
• Benchmarking optimization software with performance profiles.
• CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
• Computational Methods for Linear Matrix Equations
• Computing interior eigenvalues of large matrices
• Delayed gradient methods for symmetric and positive definite linear systems
• Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
• Handling nonpositive curvature in a limited memory steepest descent method
• Harmonic Ritz and Lehmann bounds
• Hybrid limited memory gradient projection methods for box-constrained optimization problems
• New adaptive stepsize selections in gradient methods
• On the limited memory BFGS method for large scale optimization
• On the steplength selection in gradient methods for unconstrained optimization
• On the use of harmonic Ritz pairs in approximating internal eigenpairs
• Ritz-like values in steplength selections for stochastic gradient methods
• Shifted Cholesky QR for computing the QR factorization of ill-conditioned matrices
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• The University of Florida sparse matrix collection
• Two-Point Step Size Gradient Methods
• Upper and lower bounds on the solution of the algebraic Riccati equation
• R-linear convergence of limited memory steepest descent

This page was built for publication: Limited memory gradient methods for unconstrained optimization

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