In this paper, a modified conjugate gradient method is presented for solving large-scale unconstrained optimization problems, which possesses the sufficient descent property with Strong Wolfe-Powell line search. A global convergence result was proved when the (SWP) line search was used under some conditions. Computational results for a set consisting of 138 unconstrained optimization test probl...

2 Method 1 2.1 Optical Flow . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 2.2 Lucas Kanade . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.3 Gradient Descent . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.4 Conjugate Gradient Descent . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.5 Newton’s Method . . . . . . ...

This paper is concerned with proving theoretical results related to the convergence of the Conjugate Gradient method for solving positive definite symmetric linear systems. New relations for ratios of the A-norm of the error and the norm of the residual are provided starting from some earlier results of Sadok [13]. These results use the well-known correspondence between the Conjugate Gradient m...

For solving systems of linear algebraic equations with blockfivediagonal matrices arising in geoelectrics and diffusion problems, the parallel matrix square root method, conjugate gradient method with preconditioner, conjugate gradient method with regularization, and parallel matrix sweep algorithm are proposed and some of them are implemented numerically on multi-core CPU Intel. Investigation ...

Lippert, T., K. Schilling and N. Petkov, Quark propagator on the Connection Machine, Parallel Computing 18 (1992) 1291-1299. The computation of the fermion propagator in lattice Quantum Chromodynamics requires the solution of a large system of linear equations. We discuss and compare the structure, implementation and performance of two linear equation solvers, the Jacobi algorithm and the Conju...

In the eld of computational electrodynamics the discretization of Maxwell's equations using the Finite Integration Theory (FIT) yields very large, sparse, complex symmetric linear systems of equations. For this class of complex non-Hermitian systems a number of conjugate gradient-type algorithms is considered. The complex version of the biconjugate gradient (BiCG) method by Jacobs can be extend...

.To solve the ‘soft-field’ nature and the ill-posed problem in electrical capacitance tomography (ECT) technology, this paper first presents a preconditioned conjugate gradient iterative algorithm for electrical capacitance tomography (PCG), Then, the results of the PCG algorithm using PSO method for imaging gray scale compensation. Streszczenie. Artykuł przedstawia algorytm PCG (preconditioned...

In this work, an efficient training algorithm for feedforward neural networks is presented. It is based on a scaled version of the conjugate gradient method suggested by Perry, which employs the spectral steplength of Barzilai and Borwein that contains second order information without estimating the Hessian matrix. The learning rate is automatically adapted at each epoch, using the conjugate gr...