DSpace Repository
New conjugate gradient methods for solving large-scale unconstrained optimization problems
- DSpace Home
- →
- Thesis Collections
- →
- Fakulti Sains dan Teknologi
- →
- View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Mohd Rivaie Mohd Ali | |
| dc.date.accessioned | 2014-05-18T07:21:06Z | |
| dc.date.available | 2014-05-18T07:21:06Z | |
| dc.date.issued | 2013-01 | |
| dc.identifier.uri | http://dspace.psnz.umt.edu.my/xmlui/handle/123456789/3033 | |
| dc.description.abstract | Conjugate gradient methods hold an important role in unconstrained optimizations. Numerous recent studies and modifications have been aimed to improve these methods. In this research, four modifications of the conjugate gradient coefficient (Bk ) are proposed in order to solve unconstrained optimization problems using exact line searches. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Terengganu: Universiti Malaysia Terengganu | en_US |
| dc.subject | QA 218 .M62 2013 | en_US |
| dc.subject | Mohd Rivaie Mohd Ali | en_US |
| dc.subject | Tesis FST 2013 | en_US |
| dc.subject | Conjugate gradient methods | en_US |
| dc.title | New conjugate gradient methods for solving large-scale unconstrained optimization problems | en_US |
| dc.type | Thesis | en_US |
