A gradient method using conic or quadratic models to generate approximately optimal stepsizes, with convergence analysis and comparisons to CGDESCENT and CGOPT.
H.: Gradient methods with adapt ive stepsizes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An Improved Gradient Method with Approximately Optimal Stepsize Based on Conic model for Unconstrained Optimization
A gradient method using conic or quadratic models to generate approximately optimal stepsizes, with convergence analysis and comparisons to CGDESCENT and CGOPT.