A new conjugate gradient method is proposed for applying Powell's symmetrical technique to conjugate gradient methods in this paper, which satisfies the sufficient descent property for any line search. Using Wolfe line searches, the global convergence of the method is derived from the spectral analysis of the conjugate gradient iteration matrix and Zoutendijk's condition. Based on this, two con...

The Conjugate Gradient Method is a numerical optimization technique that finds the optimal solution by focusing on coefficient conjugate. This paper presents new coefficients conjugate gradient method for removing impulse noise from images, which based quadratic function and proven to be globally convergent. Results show it an effective image restoration.

This paper proposes to extend the band width of narrow band telephone speech signal by employing feed forward back propagation neural network. There are different types of faster training algorithm are available in the literature like Variable Learning Rate, Resilient Back propagation, Polak-Ribiére Conjugate Gradient , Conjugate Gradient with Powell/Beale Restarts , BFGS Quasi-Newton , One-Ste...

This paper proposes to extend the band width of narrow band telephone speech signal by employing feed forward back propagation neural network. There are different types of faster training algorithm are available in the literature like Variable Learning Rate, Resilient Back propagation, Polak-Ribiére Conjugate Gradient , Conjugate Gradient with Powell/Beale Restarts , BFGS Quasi-Newton , One-Ste...

Conjugate gradient methods are widely used for solving large-scale unconstrained optimization problems, because they do not need the storage of matrices. In this paper, we propose a general form of three-term conjugate gradient methods which always generate a sufficient descent direction. We give a sufficient condition for the global convergence of the proposed general method. Moreover, we pres...

In this paper, we propose a three-parameter family of conjugate gradient methods for unconstrained optimization. The three-parameter family of methods not only includes the already existing six practical nonlinear conjugate gradient methods, but subsumes some other families of nonlinear conjugate gradient methods as its subfamilies. With Powell’s restart criterion, the three-parameter family of...

New accelerated nonlinear conjugate gradient algorithms which are mainly modifications of the Dai and Yuan’s for unconstrained optimization are proposed. Using the exact line search, the algorithm reduces to the Dai and Yuan conjugate gradient computational scheme. For inexact line search the algorithm satisfies the sufficient descent condition. Since the step lengths in conjugate gradient algo...

New hybrid conjugate gradient algorithms are proposed and analyzed. In these hybrid algorithms the famous parameter k β is computed as a convex combination of the Polak-Ribière-Polyak and Dai-Yuan conjugate gradient algorithms. In one hybrid algorithm the parameter in convex combination is computed in such a way that the conjugacy condition is satisfied, independent of the line search. In the o...

Conjugate gradient methods are an important class of methods for solving unconstrained optimization problems, especially for large-scale problems. Recently, they have been studied in depth. In this paper, we further study the conjugate gradient method for unconstrained optimization. We focus our attention to the descent conjugate gradient method. This paper presents a modified conjugate gradien...