| _version_ |
1860799656332623872
|
| building |
INTELEK Repository
|
| collection |
Online Access
|
| collectionurl |
https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072
|
| date |
2017-09-07 14:52:32
|
| eventvenue |
Primula Beach Hotel Kuala Terengganu, Terengganu
|
| format |
Restricted Document
|
| id |
6875
|
| institution |
UniSZA
|
| originalfilename |
1523-01-FH03-FIK-17-09950.jpg
|
| person |
norman
|
| recordtype |
oai_dc
|
| resourceurl |
https://intelek.unisza.edu.my/intelek/pages/view.php?ref=6875
|
| spelling |
6875 https://intelek.unisza.edu.my/intelek/pages/view.php?ref=6875 https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072 Restricted Document Conference Conference Paper image/jpeg inches 96 96 norman 768 01 01 1419 2017-09-07 14:52:32 1419x768 1523-01-FH03-FIK-17-09950.jpg UniSZA Private Access A new family of Polak-Ribiere-Polyak conjugate gradient method with the strong-Wolfe line search Conjugate gradient (CG) method is an important technique in unconstrained optimization, due to its effectiveness and low memory requirements. The focus of this paper is to introduce a new CG method for solving large scale unconstrained optimization. Theoretical proofs show that the new method fulfills sufficient descent condition if strong Wolfe-Powell inexact line search is used. Besides, computational results show that our proposed method outperforms to other existing CG methods. 24th National Symposium on Mathematical Sciences: Mathematical Sciences Exploration for the Universal Preservation Primula Beach Hotel Kuala Terengganu, Terengganu
|
| spellingShingle |
A new family of Polak-Ribiere-Polyak conjugate gradient method with the strong-Wolfe line search
|
| summary |
Conjugate gradient (CG) method is an important technique in unconstrained optimization, due to its effectiveness and low memory requirements. The focus of this paper is to introduce a new CG method for solving large scale unconstrained optimization. Theoretical proofs show that the new method fulfills sufficient descent condition if strong Wolfe-Powell inexact line search is used. Besides, computational results show that our proposed method outperforms to other existing CG methods.
|
| title |
A new family of Polak-Ribiere-Polyak conjugate gradient method with the strong-Wolfe line search
|
| title_full |
A new family of Polak-Ribiere-Polyak conjugate gradient method with the strong-Wolfe line search
|
| title_fullStr |
A new family of Polak-Ribiere-Polyak conjugate gradient method with the strong-Wolfe line search
|
| title_full_unstemmed |
A new family of Polak-Ribiere-Polyak conjugate gradient method with the strong-Wolfe line search
|
| title_short |
A new family of Polak-Ribiere-Polyak conjugate gradient method with the strong-Wolfe line search
|
| title_sort |
new family of polak-ribiere-polyak conjugate gradient method with the strong-wolfe line search
|