Based on the Dai-Laio and Liu-Xu methods, we develop 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 the algorithm is proved. Finally, some numerical results of the proposed method are given.
Based on the Dai-Laio and Liu-Xu methods, we develop 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 the algorithm is proved. Finally, some numerical results of the proposed method are given.
Based on the Dai-Laio and Liu-Xu methods, we develop 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 the algorithm is proved. Finally, some numerical results of the proposed method are given.
Based on the Dai-Laio and Liu-Xu methods, we develop 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 the algorithm is proved. Finally, some numerical results of the proposed method are given.
Based on the Dai-Laio and Liu-Xu methods, we develop 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 the algorithm is proved. Finally, some numerical results of the proposed method are given.
Based on the Dai-Laio and Liu-Xu methods, we develop 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 the algorithm is proved. Finally, some numerical results of the proposed method are given.
Based on the Dai-Laio and Liu-Xu methods, we develop 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 the algorithm is proved. Finally, some numerical results of the proposed method are given.
Birincil Dil | İngilizce |
---|---|
Konular | Matematik |
Bölüm | Articles |
Yazarlar | |
Yayımlanma Tarihi | 17 Eylül 2020 |
Yayımlandığı Sayı | Yıl 2020 Cilt: 3 Sayı: 1 |