✦ LIBER ✦

New step lengths in conjugate gradient methods

✍ Scribed by Yunda Dong

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 306 KB
Volume: 60
Category: Article
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2010.05.003

No coin nor oath required. For personal study only.

✦ Synopsis

Consider any conjugate gradient method for finding a zero point of a given gradient whose function is implicit. We propose two different types of conditions for selecting the step length using the gradient information only. One is used for re-proving known convergence results under the same gradient-Lipschitz assumption. Moreover, if the gradient is merely continuous then we are still able to get some interesting convergence results. The other also allows for convergence of the resulting conjugate gradient methods, with an application to convergence analysis of the Fletcher-Reeves conjugate gradient method. Preliminary numerical experiments show the efficiency of our proposed step length rules in practice.

📜 SIMILAR VOLUMES

A new family of conjugate gradient metho

A new family of conjugate gradient methods

✍ Zhen-Jun Shi; Jinhua Guo 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 659 KB

In this paper we develop a new class of conjugate gradient methods for unconstrained optimization problems. A new nonmonotone line search technique is proposed to guarantee the global convergence of these conjugate gradient methods under some mild conditions. In particular, Polak-Ribiére-Polyak and

Conjugate gradient methods in Banach spa

Conjugate gradient methods in Banach spaces

✍ I. Stein Jr. 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 115 KB

Parallel m-step preconditioners for the

Parallel m-step preconditioners for the conjugate gradient method

✍ Cristina Corral; Isabel Giménez; José Marı́n; José Mas 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 179 KB

To obtain an ecient parallel algorithm to solve sparse linear systems with the preconditioned conjugate gradient (PCG) method, two types of parallel preconditioners are introduced. The ®rst is a polynomial preconditioner type based on a multisplitting of the matrix system, and the second one is obta

Two new conjugate gradient methods based

Two new conjugate gradient methods based on modified secant equations

✍ Saman Babaie-Kafaki; Reza Ghanbari; Nezam Mahdavi-Amiri 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 415 KB

A conjugate direction gradient method wi

A conjugate direction gradient method with reconnaissance steps for unconstrained minimization

✍ J.A. Snyman; M. van Rooyen 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 511 KB

New spectral PRP conjugate gradient meth

New spectral PRP conjugate gradient method for unconstrained optimization

✍ Zhong Wan; ZhanLu Yang; YaLin Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 230 KB

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