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
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10957-011-9960-x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2039084584 / rank | |||
Normal rank |
Revision as of 18:52, 19 March 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