According to conjugate gradient algorithm, a new consensus protocol algorithm of discrete-time multi-agent systems is presented, which can achieve finite-time consensus. Finally, a numerical example is given to illustrate our theoretical result. Keywords—Consensus protocols; Graph theory; Multi-agent systems; Conjugate gradient algorithm; Finite-time.

In this paper, by using the smoothing Fischer-Burmeister function, we present a new smoothing conjugate gradient method for solving the nonlinear nonsmooth complementarity problems. The line search which we used guarantees the descent of the method. Under suitable conditions, the new smoothing conjugate gradient method is proved globally convergent. Finally, preliminary numerical experiments sh...

Parallel normalized preconditioned conjugate gradient type methods based on normalized approximate finite element inverse matrix techniques are investigated for the efficient solution of sparse linear systems. Application of the proposed methods on a three dimensional boundary value problems is discussed and numerical results are given. The parallel implementation of the normalized precondition...

Inspired by Tikhonov regularization, a non-linear conjugate gradient method is proposed with the purpose of simultaneously regularizing and solving the moment matrix equation. The procedure is based on a non-quadratic conjugate gradient algorithm with exact line search, restart and rescale. Applied to the problem of TM scattering by perfectly conducting rectangular cylinders, the method is show...

This Paper focused on adaptive conjugate gradient method (CGM) algorithm and the same is compared with one of the fastest adaptive algorithm named recursive least squares (RLS) algorithm. This algorithms has improved the computation complexity and better convergence. MATLAB simulation showed that conjugate gradient algorithm has better output signal resolution.