Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization (Q438775)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6062505
Language Label Description Also known as
default for all languages
No label defined
    English
    Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
    scientific article; zbMATH DE number 6062505

      Statements

      Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization (English)
      0 references
      0 references
      0 references
      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
      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

      Identifiers