A limited memory steepest descent method
From MaRDI portal
Publication:715093
DOI10.1007/S10107-011-0479-6zbMATH Open1254.90113OpenAlexW2093575660MaRDI QIDQ715093FDOQ715093
Authors: Roger Fletcher 
Publication date: 15 October 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-011-0479-6
Recommendations
- A new stepsize for the steepest descent method
- scientific article; zbMATH DE number 2221955
- The Limited Memory Conjugate Gradient Method
- A modified limited memory steepest descent method motivated by an inexact super-linear convergence rate analysis
- \(R\)-linear convergence of limited memory steepest descent
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26)
Cites Work
- Gradient projection methods for quadratic programs and applications in training support vector machines
- CUTEr and SifDec
- A Rapidly Convergent Descent Method for Minimization
- Title not available (Why is that?)
- Updating Quasi-Newton Matrices with Limited Storage
- Title not available (Why is that?)
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
- Representations of quasi-Newton matrices and their use in limited memory methods
- A Nonmonotone Line Search Technique for Newton’s Method
- Analysis of monotone gradient methods
- Gradient Method with Retards and Generalizations
- A new stepsize for the steepest descent method
- Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- On the Barzilai and Borwein choice of steplength for the gradient method
- Relaxed steepest descent and Cauchy-Barzilai-Borwein method
- On the asymptotic behaviour of some new gradient methods
- Title not available (Why is that?)
- Preconditioned Barzilai-Borwein method for the numerical solution of partial differential equations
Cited In (34)
- A comparison of edge-preserving approaches for differential interference contrast microscopy
- A coordinate descent method for total variation minimization
- Stabilized BB projection algorithm for large-scale convex constrained nonlinear monotone equations to signal and image processing problems
- Hybrid limited memory gradient projection methods for box-constrained optimization problems
- Special issue for SIMAI 2020-2021: large-scale optimization and applications
- On the regularizing behavior of the SDA and SDC gradient methods in the solution of linear ill-posed problems
- On the application of the spectral projected gradient method in image segmentation
- An efficient gradient method using the Yuan steplength
- Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems
- Steplength selection in gradient projection methods for box-constrained quadratic programs
- On Quasi-Newton Forward-Backward Splitting: Proximal Calculus and Convergence
- A cyclic block coordinate descent method with generalized gradient projections
- A hybrid quasi-Newton projected-gradient method with application to lasso and basis-pursuit denoising
- Cyclic gradient methods for unconstrained optimization
- Delayed weighted gradient method with simultaneous step-sizes for strongly convex optimization
- New stepsizes for the gradient method
- Analysis of the Barzilai-Borwein step-sizes for problems in Hilbert spaces
- Numerical methods for parameter estimation in Poisson data inversion
- A second-order gradient method for convex minimization
- On the steplength selection in gradient methods for unconstrained optimization
- Title not available (Why is that?)
- On the acceleration of the Barzilai-Borwein method
- A new steplength selection for scaled gradient methods with application to image deblurring
- Gravity-magnetic cross-gradient joint inversion by the cyclic gradient method
- Title not available (Why is that?)
- Convergence of Inexact Forward--Backward Algorithms Using the Forward--Backward Envelope
- Cooperative concurrent asynchronous computation of the solution of symmetric linear systems
- Gradient method with multiple damping for large-scale unconstrained optimization
- A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization
- Scaling techniques for \(\epsilon\)-subgradient methods
- Variations of the steepest descent method in nonrestricted optimization
- Ritz-like values in steplength selections for stochastic gradient methods
- Asymptotic rate of convergence of a two-layer iterative method of the variational type
- ACQUIRE: an inexact iteratively reweighted norm approach for TV-based Poisson image restoration
Uses Software
This page was built for publication: A limited memory steepest descent method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q715093)
