|
|
|
|
Three-terms conjugate gradient algorithm based on the Dai-Liao and the Powell symmetric methods
|
|
|
|
|
|
|
|
نویسنده
|
abbo khalil k. ,namik aynur j.
|
|
منبع
|
kirkuk university journal: scientific studies - 2017 - دوره : 12 - شماره : 2 - صفحه:1 -19
|
|
چکیده
|
Based on the dai-laio and powell symmetric methods, we developed a new three – term conjugate gradient method for solving large-scale unconstrained optimization problem. the suggested method satisfies both the descent condition and the conjugacy condition. for uniformly convex function, under standard assumption the global convergence of thealgorithm is proved. finally, some numerical results of the proposed method are given.
|
|
کلیدواژه
|
Unconstrained optimization ,descent methods ,Conjugate gradient methods
|
|
آدرس
|
mosul university, college of computer science & mathematics, department of mathematics, Iraq, mosul university, college of computers sciences and mathematics, department of mathematics, Iraq
|
|
پست الکترونیکی
|
aynoor.javdet@gmail.com
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|