Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization (Q438775): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
(One intermediate revision by one other user not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s10957-011-9960-x / rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S10957-011-9960-X / rank | |||
Normal rank |
Latest revision as of 17:39, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization |
scientific article |
Statements
Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization (English)
0 references
31 July 2012
0 references
Making use of the three-term conjugate gradient methods by \textit{Y. Narushima, H. Yabe} and \textit{J. A. Ford} [SIAM J. Optim. 21, No. 1, 212--230 (2011; Zbl 1250.90087)], the authors propose three-term conjugate gradient methods based on secant conditions for unconstrained optimization problems and prove the global convergence of the methods. Special-purpose three-term conjugate gradient methods based on structured secant conditions are also given together with applying them to nonlinear least squares problems and some numerical experiments.
0 references
three-term conjugate gradient methods
0 references
secant conditions
0 references
global convergence
0 references
unconstrained optimization problems
0 references
descent search directions
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references