نتایج جستجو برای: conjugate gradient methods
تعداد نتایج: 2006107 فیلتر نتایج به سال:
This paper deals with control strategies for the Hegselmann–Krause opinion formation model with leadership. In this system, the control mechanism is included in the leader dynamics and the feedback control functions are determined via a stabilization procedure and with a model predictive optimal control process. Correspondingly, the issues of global stabilization, controllability, and tracking ...
We propose a novel variant of conjugate gradient based on the Reproducing Kernel Hilbert Space (RKHS) inner product. An analysis of the algorithm suggests it enjoys better performance properties than standard iterative methods when applied to learning kernel machines. Experimental results for both classification and regression bear out the theoretical implications. We further address the domina...
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...
We study efficient implicit methods to denoise low-field MR images using a nonlinear diffusion operator as regularizer. This problem can be formulated solving reaction–diffusion equation. After discretization, lagged-diffusion approach is used which requires linear system solve in every iteration. The choice of model determines the denoising properties, but it also influences conditioning syste...
In this paper we present a variant of the conjugate gradient (CG) algorithm in which we invoke a subspace minimization subproblem on each iteration. We call this algorithm CGSO for “conjugate gradient with subspace optimization”. It is related to earlier work by Nemirovsky and Yudin. We apply the algorithm to solve unconstrained strictly convex problems. As with other CG algorithms, the update ...
We present a short survey of multigrid–based solvers for symmetric eigenvalue problems. We concentrate our attention on “of the shelf” and “black box” methods, which should allow solving eigenvalue problems with minimal, or no, effort on the part of the developer, taking advantage of already existing algorithms and software. We consider a class of such methods, where the multigrid only appears ...
In mathematics, the conjugate gradient method is an algorithm for the numerical solution of particular systems of linear equations, namely those whose matrix is symmetric and positive-definite. The conjugate gradient method is often implemented as an iterative algorithm, applicable to sparse systems that are too large to be handled by a direct implementation or other direct methods such as the ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید