نتایج جستجو برای: dai liao conjugate gradient method

تعداد نتایج: 1758206  

In this paper the conjugate gradient (CG) method is employed for identifying the parameters of crack in a functionally graded beam from natural frequency measurement. The crack is modeled as a massless rotational spring with sectional flexibility. By using the Euler-Bernoulli beam theory on two separate beams respectively and applying the compatibility requirements of the crack, the characteris...

2010
Neculai Andrei

In this paper we suggest another accelerated conjugate gradient algorithm that for all both the descent and the conjugacy conditions are guaranteed. The search direction is selected as where , The coefficients 0 k ≥ 1 1 1 1 ( / ) ( / ) T T T T k k k k k k k k k k k k k k d g y g y s s t s g y s θ + + + + = − + − , s 1 1 ( ) k k g f x + + = ∇ 1 . k k k s x x + = − k θ and in this linear combinat...

Journal: :International Journal of Biomedical Imaging 2007
Shang Shang Jing Bai Xiaolei Song Hongkai Wang Jaclyn Lau

Conjugate gradient method is verified to be efficient for nonlinear optimization problems of large-dimension data. In this paper, a penalized linear and nonlinear combined conjugate gradient method for the reconstruction of fluorescence molecular tomography (FMT) is presented. The algorithm combines the linear conjugate gradient method and the nonlinear conjugate gradient method together based ...

2004
XIAODONG ZHANG PATRICK J. FLYNN P. J. Flynn

In ultrasound inverse problems, the integral equation can be nonlinear, ill-posed, and computationally expensive. One approach to solving such problems is the conjugate gradient (CG) method. A key parameter in the CG method is the conjugate gradient direction. In this paper, we investigate the CG directions proposed by Polyak et al. (PPR), Hestenes and Stiefel (HS), Fletcher and Reeves (FR), Da...

Journal: :Journal of Computational and Applied Mathematics 2010

Journal: :SIAM Journal on Optimization 2011
Yasushi Narushima Hiroshi Yabe John A. Ford

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

Journal: :SIAM Journal on Matrix Analysis and Applications 2018

Journal: :Journal of Computational and Applied Mathematics 1983

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید