Two modified HS type conjugate gradient methods for unconstrained optimization problems
β Scribed by Zhi-Feng Dai
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 941 KB
- Volume
- 74
- Category
- Article
- ISSN
- 0362-546X
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
In this paper, we propose two new hybrid nonlinear conjugate gradient methods, which produce sufficient descent search direction at every iteration. This property depends neither on the line search used nor on the convexity of the objective function. Under suitable conditions, we prove that the prop
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
This paper applies directly the method of conjugate gradients in function space to the iterative solution of optimal control problems in which the control variables must satisfy inequality constraints. Two different conjugate gradient algorithms and their modifications to includ~ bounded control var