Gradient Methods for Nonstationary Unconstrained Optimization Problems
β Scribed by A. Yu. Popkov
- Publisher
- SP MAIK Nauka/Interperiodica
- Year
- 2005
- Tongue
- English
- Weight
- 133 KB
- Volume
- 66
- Category
- Article
- ISSN
- 0005-1179
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, a new spectral PRP conjugate gradient algorithm has been developed for solving unconstrained optimization problems, where the search direction was a kind of combination of the gradient and the obtained direction, and the steplength was obtained by the Wolfe-type inexact line search. I
A modified conjugate gradient method is presented for solving unconstrained optimization problems, which possesses the following properties: (i) The sufficient descent property is satisfied without any line search; (ii) The search direction will be in a trust region automatically; (iii) The Zoutendi