A new spectral conjugate gradient and its global convergence

Conjugate gradient (CG) method is the well-known method for solving unconstrained problems. The CG methods have many advantages such as its simple algorithm , low memory storage ad global convergence properties. In this research , a new spectral CG is proposed by modifying Rivaie-Mustafa -Ismail-Le...

Full description

Bibliographic Details
Main Author: Norhaslinda Zull Pakkal (Author)
Corporate Author: Universiti Sultan Zainal Abidin . Faculty of Informatics & Computing
Format: Thesis Book
Language:Malay
Subjects:

MARC

LEADER 00000cam a2200000 7i4500
001 0000090317
005 20200723093000.0
008 170109s2015 my may
040 |a UniSZA   |e rda 
050 0 0 |a QA218   |b .N67 2015 
090 0 0 |a QA218   |b .N67 2015 
100 0 |a Norhaslinda Zull Pakkal ,   |e author 
245 1 2 |a A new spectral conjugate gradient and its global convergence   |c Norhaslinda binti Zull Pakkal 
264 0 |c 2015 
300 |a xiii, 85 leaves :   |b ill. (some col.) ;   |c 30 cm. 
336 |a text  |2 rdacontent 
337 |a unmediated  |2 rdamedia 
338 |a volume  |2 rdacarrier 
502 |a Thesis (Degree of Master of Science) - Universiti Sultan Zainal Abidin, 2015 
504 |a Includes bibliographical references (leaves 80-84) 
505 0 |a 1. Introduction -- 2. Literature review -- 3. Methodology -- 4. Modification of conjugate gradient method -- 5. Numerical results and discussion -- 6. Conclusion and suggestions 
520 |a Conjugate gradient (CG) method is the well-known method for solving unconstrained problems. The CG methods have many advantages such as its simple algorithm , low memory storage ad global convergence properties. In this research , a new spectral CG is proposed by modifying Rivaie-Mustafa -Ismail-Leong (RMIL) method. This new method is known as Spectral RMIL (SRMIL). Using inexact Strong Wolfe line search, this new spectral CG is compared with some famous classical CG coefficient such as RMIL, Polak and Ribiere (PR) and Conjugate Descent (CD) methods. Different set of variables have been chosen to be tested with fifteen standard test problems utilizing matlabR2012 subroutine programming. Four different initial points have been used for each standard test problems in order to show the efficiency of this method. The initial points have been from the one that is closer to the minimum point and to the one that is further away from the minimum point. The percentages of comparisons based on the iteration number show 96.43% ( SRMIL) and SCD), 93.59 % ( SRMIL and CD), 85.00 % (SRMIL and RMIL) and 77.14 % ( SRMIL and PR ). Meanwhile the percentages of comparisons for central Processing Unit ( CPU) times show 92.14 % ( SRMIL an PR ). Thus, this new method outperforms the other CG methods. Besides, numerical results based on the iteration number and CPU time also show that this new proposed method possessed global convergence properties. 
610 2 0 |a Conjugate gradient methods-Data processing 
610 2 0 |a Universiti Sultan Zainal Abidin   |x Dissertations 
610 2 0 |a Universiti Sultan Zainal Abidin   |x Faculty of Informatics and Computing   |v Dissertations 
655 0 |a Dissertations, Academic 
710 2 |a Universiti Sultan Zainal Abidin .   |b Faculty of Informatics & Computing 
999 |a 1000167577   |b Thesis   |c Reference   |e Tembila Campus