نتایج جستجو برای: hybrid conjugate gradient algorithm

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

Journal: :Appl. Math. Lett. 2008
Neculai Andrei

A modification of the Dai-Yuan conjugate gradient algorithm is proposed. Using the exact line search, the algorithm reduces to the original version of the Dai and Yuan computational scheme. For inexact line search the algorithm satisfies both the sufficient descent and conjugacy condition. A global convergence result is proved when the Wolfe line search conditions are used. Computational result...

2008
Neculai Andrei

New accelerated nonlinear conjugate gradient algorithms which are mainly modifications of the Dai and Yuan’s for unconstrained optimization are proposed. Using the exact line search, the algorithm reduces to the Dai and Yuan conjugate gradient computational scheme. For inexact line search the algorithm satisfies the sufficient descent condition. Since the step lengths in conjugate gradient algo...

1995
M Heyouni H Sadok

The smoothing procedure has been introduced by Schh onauer as an acceleration algorithm for the Generalized Conjugate Gradient methods. In this paper, after giving our deenition of Conjugate Gradient type methods, and using a Generalized Hessenberg process, we introduce a Hybrid generalized Conjugate Gradient type method. We show that this Hybrid procedure is a variable smoothing procedure. And...

Journal: :international journal of automotive engineering 0
kakaee keshavarz

in this study it has been tried, to compare results and convergence rate of sensitivity analysis and conjugate gradient algorithms to reduce fuel consumption and increasing engine performance by optimizing the timing of opening and closing valves in xu7/l3 engine. in this study, considering the strength and accuracy of simulation gt-power software in researches on the internal combustion engine...

Journal: :International Journal of Computer Networks and Communications Security 2020

Journal: :Rairo-operations Research 2022

In this paper, we proposed a new hybrid conjugate gradient algorithm for solving unconstrained optimization problems as convex combination of the Dai-Yuan algorithm, conjugate-descent and Hestenes-Stiefel algorithm. This is globally convergent satisfies sufficient descent condition by using strong Wolfe conditions. The numerical results show that nonlinear efficient robust.

Kakaee, Keshavarz,

In this study it has been tried, to compare results and convergence rate of sensitivity analysis and conjugate gradient algorithms to reduce fuel consumption and increasing engine performance by optimizing the timing of opening and closing valves in XU7/L3 engine. In this study, considering the strength and accuracy of simulation GT-POWER software in researches on the internal combustion engine...

Journal: :international journal of advanced design and manufacturing technology 0
mahmud khodadad mohsen dashtiardakani

the effect of boundary conditions on the solution of the inverse problem of identifying the geometry and location of a cavity inside an elastic solid body using displacement measurements obtained from a tension test is investigated. the boundary elements method (bem) coupled with the genetic algorithm (ga) and the conjugate gradient method (cgm) are implemented in this identification problem. a...

M. Ranjbar, Z. Akbari,

In this paper we consider a constrained optimization problem where the objectives are fuzzy functions (fuzzy-valued functions). Fuzzy constrained Optimization (FO) problem plays an important role in many fields, including mathematics, engineering, statistics and so on. In the other side, in the real situations, it is important to know how may obtain its numerical solution of a given interesting...

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

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