Computation and performance analysis of existing three term conjugate gradient method
The three-term Conjugate Gradient (CG) method is employed to solve unconstrained optimization problem (UOP) according to its efficiency and numerical performances. The three-term CG methods used were three-term Hestenes-Stiefel (TTHS) and three term new RMIL (3TNRMIL). The efficiency of the method i...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
World Academy of Research in Science and Engineering
2019
|
Subjects: | |
Online Access: | View Fulltext in Publisher View in Scopus |
LEADER | 02105nam a2200241Ia 4500 | ||
---|---|---|---|
001 | 10.30534-ijatcse-2019-1981.52019 | ||
008 | 220121s2019 CNT 000 0 und d | ||
020 | |a 22783091 (ISSN) | ||
245 | 1 | 0 | |a Computation and performance analysis of existing three term conjugate gradient method |
260 | 0 | |b World Academy of Research in Science and Engineering |c 2019 | |
650 | 0 | 4 | |a Conjugate gradient method |
650 | 0 | 4 | |a Scaling CG |
650 | 0 | 4 | |a Three term |
650 | 0 | 4 | |a Unconstrained optimization |
856 | |z View Fulltext in Publisher |u https://doi.org/10.30534/ijatcse/2019/1981.52019 | ||
856 | |z View in Scopus |u https://www.scopus.com/inward/record.uri?eid=2-s2.0-85078328900&doi=10.30534%2fijatcse%2f2019%2f1981.52019&partnerID=40&md5=8c25491fcb61258d288b86c46e4aee25 | ||
520 | 3 | |a The three-term Conjugate Gradient (CG) method is employed to solve unconstrained optimization problem (UOP) according to its efficiency and numerical performances. The three-term CG methods used were three-term Hestenes-Stiefel (TTHS) and three term new RMIL (3TNRMIL). The efficiency of the method is shown through comparison with all the three-term CG methods. The original three-term is compared with its modified scaling initial direction. The total test run involved in the numerical experiment was 800 that comprised of 5 test functions. The five test functions that were selected were Extended Himmelblau, Extended Rosenbrock, Extended White and Holst, Extended Beale and Shallow Functions with dimensions of 1200, 3000, 6000, and 9000. The performance profile is analysed based on number of iteration (NOI) and CPU time. Result shows that the modified TTHS performed better than the original TTHS and 3TNRMIL. © 2019, World Academy of Research in Science and Engineering. All rights reserved. | |
700 | 1 | 0 | |a Arizi, N.A.N.M. |e author |
700 | 1 | 0 | |a Buchek, N.F. |e author |
700 | 1 | 0 | |a Fadhilah, N.H. |e author |
700 | 1 | 0 | |a Idalisa, N. |e author |
700 | 1 | 0 | |a Norizan, N.S. |e author |
773 | |t International Journal of Advanced Trends in Computer Science and Engineering |x 22783091 (ISSN) |g 8 1.5 Special Issue, 91-95 |