A new adaptive Barzilai and Borwein method for unconstrained optimization
From MaRDI portal
Publication:1653281
DOI10.1007/s11590-017-1150-9zbMath1403.90620OpenAlexW2617742785MaRDI QIDQ1653281
Zexian Liu, Hong-Wei Liu, Xiao Liang Dong
Publication date: 3 August 2018
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-017-1150-9
nonmonotone line searchadaptive stepsizeBarzilai and Borwein (BB) methodBroyden class update formulastrictly convex quadratic minimization
Related Items (6)
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 ⋮ An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization ⋮ An efficient gradient method with approximate optimal stepsize for the strictly convex quadratic minimization problem ⋮ Improved SVRG for finite sum structure optimization with application to binary classification ⋮ An efficient nonmonotone adaptive cubic regularization method with line search for unconstrained optimization problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scaling on the spectral gradient method
- A new analysis on the Barzilai-Borwein gradient method
- New quasi-Newton methods via higher order tensor models
- Gradient methods with adaptive step-sizes
- 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
- Gradient method with dynamical retards for large-scale optimization problems
- New quasi-Newton methods for unconstrained optimization problems
- R-linear convergence of the Barzilai and Borwein gradient method
- On spectral properties of steepest descent methods
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Sizing and Least-Change Secant Methods
- Two-Point Step Size Gradient Methods
- Gradient Method with Retards and Generalizations
- Alternate step gradient method*
- 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
- On the Barzilai and Borwein choice of steplength for the gradient method
- The cyclic Barzilai-–Borwein method for unconstrained optimization
- Benchmarking optimization software with performance profiles.
This page was built for publication: A new adaptive Barzilai and Borwein method for unconstrained optimization
