On three-term conjugate gradient algorithms for unconstrained optimization

Neculai Andrei

doi:10.1016/j.amc.2012.11.097

ScienceGate Book Chapters

JOURNAL ARTICLE

On three-term conjugate gradient algorithms for unconstrained optimization

Neculai Andrei

Year: 2013 Journal: Applied Mathematics and Computation Vol: 219 (11)Pages: 6316-6327 Publisher: Elsevier BV

DOI: 10.1016/j.amc.2012.11.097

Get Full-Text PDF Get Analytical Report

Keywords:

Conjugate gradient method Nonlinear conjugate gradient method Gradient descent Derivation of the conjugate gradient method Mathematics Broyden–Fletcher–Goldfarb–Shanno algorithm Algorithm Conjugacy class Conjugate residual method Biconjugate gradient method Line search Gradient method Term (time) Computer science Combinatorics Artificial intelligence

Metrics

Cited By

6.56

FWCI (Field Weighted Citation Impact)

Refs

0.98

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Optimization Algorithms Research

Physical Sciences → Mathematics → Numerical Analysis

Optimization and Variational Analysis

Physical Sciences → Computer Science → Computational Theory and Mathematics

Iterative Methods for Nonlinear Equations

Physical Sciences → Mathematics → Numerical Analysis

On three-term conjugate gradient algorithms for unconstrained optimization

Metrics

Citation History

Topics

Related Documents

A New Scaled Three-Term Conjugate Gradient Algorithms For Unconstrained Optimization

A NEW PARAMETER IN THREE-TERM CONJUGATE GRADIENT ALGORITHMS FOR UNCONSTRAINED OPTIMIZATION

A new parameter in three-term conjugate gradient algorithms for unconstrained optimization

Some Three-Term Conjugate Gradient Algorithms with Descent Condition for Unconstrained Optimization Models

Scaled conjugate gradient algorithms for unconstrained optimization