Scaling on the spectral gradient method
From MaRDI portal
Publication:368739
DOI10.1007/S10957-012-0265-5zbMATH Open1272.90084OpenAlexW1998174084MaRDI QIDQ368739FDOQ368739
Authors: Fahimeh Biglari, Maghsud Solimanpur
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
Recommendations
Cites Work
- Benchmarking optimization software with performance profiles.
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- An unconstrained optimization test functions collection
- A Nonmonotone Line Search Technique for Newton’s Method
- Title not available (Why is that?)
- New quasi-Newton methods for unconstrained optimization problems
- New quasi-Newton equation and related methods for unconstrained optimization
- Notes on the Dai-Yuan-Yuan modified spectral gradient method
- Modified two-point stepsize gradient methods for unconstrained optimization
- New quasi-Newton methods via higher order tensor models
Cited In (13)
- A hybrid BB-type method for solving large scale unconstrained optimization
- A survey of the spectral gradient method
- An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization
- Several efficient gradient methods with approximate optimal stepsizes for large scale unconstrained optimization
- New gradient methods with adaptive stepsizes by approximate models
- A new adaptive Barzilai and Borwein method for unconstrained optimization
- Optimal scaling parameters for spectral conjugate gradient methods
- Structured two-point stepsize gradient methods for nonlinear least squares
- A family of spectral gradient methods for optimization
- An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization
- The new spectral conjugate gradient method for large-scale unconstrained optimisation
- An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization
- Gradient methods exploiting spectral properties
Uses Software
This page was built for publication: Scaling on the spectral gradient method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q368739)