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...

Thresholding is one of the most important techniques for performing image segmentation. In this paper to compute optimum thresholds for Maximum Tsallis entropy thresholding (MTET) model, a new hybrid algorithm is proposed by integrating the Comprehensive Learning Particle Swarm Optimizer (CPSO) with the Powell’s Conjugate Gradient (PCG) method. Here the CPSO will act as the main optimizer for s...

Abstract. We propose and study, for structural dynamic problems, a domain decomposition method based on an augmented Lagrangian formulation. This method uses an inexact Uzawa algorithm to solve the linear system required at any time increment. The proposed algorithm is interesting, for parallel and vector applications, because it doesn’t need scalar products and has less operations by iteration...

In Hybrid Monte Carlo simulations for full QCD, the gauge fields evolve smoothly as a function of Molecular Dynamics time. Here we investigate improved methods of estimating the trial or starting solutions for the Dirac matrix inversion as superpositions of a chronological sequence of solutions in the recent past. By taking as the trial solution the vector which minimizes the residual in the li...

This paper proposes a line search technique to satisfy a relaxed form of the strong Wolfe conditions in order to guarantee the descent condition at each iteration of the Polak-Ribière-Polyak conjugate gradient algorithm. It is proved that this line search algorithm preserves the usual convergence properties of any descent algorithm. In particular, it is shown that the Zoutendijk condition holds...

A hybrid method combining the FR conjugate gradient method and the WYL conjugate gradient method is proposed for unconstrained optimization problems. The presented method possesses the sufficient descent property under the strong Wolfe-Powell SWP line search rule relaxing the parameter σ < 1. Under the suitable conditions, the global convergence with the SWP line search rule and the weak Wolfe-...