|
|
|
|
| LEADER |
00000cam a2200000 7i4500 |
| 001 |
0000094039 |
| 005 |
20200723093000.0 |
| 008 |
180227s2017 my eng |
| 040 |
|
|
|a UniSZA
|e rda
|
| 050 |
0 |
0 |
|a QA218
|b .N878 2017
|
| 090 |
0 |
0 |
|a QA218
|b .N878 2017
|
| 100 |
0 |
|
|a Nurul 'Aini Harun ,
|e author
|
| 245 |
1 |
0 |
|a New conjugate gradient and its hybrid method for unconstrained optimization problems
|c Nurul 'Aini Binti Harun
|
| 264 |
|
0 |
|c 2017
|
| 300 |
|
|
|a xvi, 252 leaves :
|b illustrations (some colour) ;
|c 30cm.
|
| 336 |
|
|
|a text
|2 rdacontent
|
| 337 |
|
|
|a unmediated
|2 rdamedia
|
| 338 |
|
|
|a volume
|2 rdacarrier
|
| 502 |
|
|
|a Thesis (Degree of Doctor of Philosophy) - Universiti Sultan Zainal Abidin, 2017
|
| 504 |
|
|
|a Includes bibliographical references (leaves 157-167)
|
| 505 |
0 |
|
|a 1. Research overview -- 2. Basic concepts of unconstrained optimization -- 3. Methodology -- 4. Modification of conjugate gradient method -- 5. Hybrid quasi-newton method -- 6. Application in regression analysis -- 7. Conclusion
|
| 520 |
|
|
|a There are several methods for solving unconstrained optimization functions. Of these methods, the ones most commonly u ed are the conjugate gradient (CG) and quasi¬Newton (QN) method. The CG approach is suitable for large scale problems because of its low memory requirement. However, most developments in the CG method involve complex equation for its search direction, making it difficult to implement. Some of them are also not globally convergent. The QN method is efficient for solving problems of small and medium cale though it becomes increasingly slow when applied to large-scale problems. This is due to the n x n matrix in its search direction formula that leads to high memory requirement. In this study, a globally convergent CG coefficient is presented. The new algorithm is based on cia sical CG which is simple and also efficient in solving unconstrained optimization problems. Next, to improve the efficiency of the QN method, a hybrid search direction of QN and CG method is proposed. The CG method is chosen for its computational capability in solving large scale problems and good convergence properties. The CG coefficient proposed in this thesis is used in the hybrid search direction. The new algorithms are shown to possess sufficient descent and global convergence propertie when used with strong Wolfe line search. For the numerical tests, twenty-five standard functions are used with varying dimension levels and starting points. The test measures the performance of the solvers in terms of iteration number and CPU time. All of the computation process is performed by Matlab r2012 programme. The performance of the new CG method is compared with some of the current CG methods while the new hybrid QN method is compared with the original QN and two existing hybrid QN methods. An application in data fitting is also included to prove the applicability of the new approaches in real life problem. Based on the numerical results, the proposed CG has the highest number of test problems solved. It also has the lowest number of iteration and CPU time compared to other CG methods tested. Next, the new hybrid QN method show similar results when compared with other QN based solvers. The proposed algorithms also proved to be applicable for data fitting. The new CG and hybrid QN methods have shown great efficiency in solving unconstrained optimization test problems and the real life problem. Moreover, both approaches possess the sufficient descent and global convergence property as demonstrated by the theoretical and numerical proofs.
|
| 610 |
2 |
0 |
|a Universiti Sultan Zainal Abidin
|x Faculty of Informatics and Computing
|v Dissertations
|
| 650 |
|
0 |
|a Conjugate gradient methods
|
| 650 |
|
0 |
|a Conjugate gradient methods-Data processing
|
| 655 |
|
0 |
|a Dissertations, Academic
|
| 710 |
2 |
|
|a Universiti Sultan Zainal Abidin .
|b Faculty of Informatics and computing
|
| 999 |
|
|
|a 1000173181
|b Thesis
|c Reference
|e Tembila Campus
|