Scaling on the spectral gradient method
From MaRDI portal
Publication:368739
DOI10.1007/s10957-012-0265-5zbMath1272.90084OpenAlexW1998174084MaRDI QIDQ368739
Maghsud Solimanpur, Fahimeh Biglari
Publication date: 23 September 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0265-5
Related Items
A new adaptive Barzilai and Borwein method for unconstrained optimization ⋮ Several efficient gradient methods with approximate optimal stepsizes for large scale unconstrained optimization ⋮ Structured two-point stepsize gradient methods for nonlinear least squares ⋮ An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization ⋮ A hybrid BB-type method for solving large scale unconstrained optimization ⋮ An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization ⋮ An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization ⋮ The new spectral conjugate gradient method for large-scale unconstrained optimisation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- New quasi-Newton methods via higher order tensor models
- Notes on the Dai-Yuan-Yuan modified spectral gradient method
- New quasi-Newton equation and related methods for unconstrained optimization
- Modified two-point stepsize gradient methods for unconstrained optimization
- New quasi-Newton methods for unconstrained optimization problems
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- Benchmarking optimization software with performance profiles.
This page was built for publication: Scaling on the spectral gradient method
