Sufficient descent three term conjugate gradient method via symmetric rank-one update for large-scale optimization
In this paper, we propose a three-term conjugate gradient method via the symmetric rank-one update. The basic idea is to exploit the good properties of the SR1 update in providing quality Hessian approximations to construct a conjugate gradient line search direction without the storage of matrices a...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis
2016
|
| Subjects: | |
| Online Access: | http://psasir.upm.edu.my/id/eprint/53933/ http://psasir.upm.edu.my/id/eprint/53933/1/Sufficient%20descent%20three%20term%20conjugate%20gradient%20method%20.pdf |
| _version_ | 1848852415357386752 |
|---|---|
| author | Moyi, Aliyu Usman Leong, Wah June |
| author_facet | Moyi, Aliyu Usman Leong, Wah June |
| author_sort | Moyi, Aliyu Usman |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | In this paper, we propose a three-term conjugate gradient method via the symmetric rank-one update. The basic idea is to exploit the good properties of the SR1 update in providing quality Hessian approximations to construct a conjugate gradient line search direction without the storage of matrices and possess the sufficient descent property. Numerical experiments on a set of standard unconstrained optimization problems showed that the proposed method is superior to many well-known conjugate gradient methods in terms of efficiency and robustness. |
| first_indexed | 2025-11-15T10:37:43Z |
| format | Article |
| id | upm-53933 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T10:37:43Z |
| publishDate | 2016 |
| publisher | Taylor & Francis |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-539332018-02-21T09:15:34Z http://psasir.upm.edu.my/id/eprint/53933/ Sufficient descent three term conjugate gradient method via symmetric rank-one update for large-scale optimization Moyi, Aliyu Usman Leong, Wah June In this paper, we propose a three-term conjugate gradient method via the symmetric rank-one update. The basic idea is to exploit the good properties of the SR1 update in providing quality Hessian approximations to construct a conjugate gradient line search direction without the storage of matrices and possess the sufficient descent property. Numerical experiments on a set of standard unconstrained optimization problems showed that the proposed method is superior to many well-known conjugate gradient methods in terms of efficiency and robustness. Taylor & Francis 2016 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/53933/1/Sufficient%20descent%20three%20term%20conjugate%20gradient%20method%20.pdf Moyi, Aliyu Usman and Leong, Wah June (2016) Sufficient descent three term conjugate gradient method via symmetric rank-one update for large-scale optimization. Optimization, 65 (1). pp. 121-143. ISSN 0233-1934; ESSN: 1029-4945 http://www.tandfonline.com/doi/abs/10.1080/02331934.2014.994625?journalCode=gopt20 Unconstrained optimization; Symmetric rank-one update; Three-term conjugate gradient method; Memoryless update; Sufficient descent 10.1080/02331934.2014.994625 |
| spellingShingle | Unconstrained optimization; Symmetric rank-one update; Three-term conjugate gradient method; Memoryless update; Sufficient descent Moyi, Aliyu Usman Leong, Wah June Sufficient descent three term conjugate gradient method via symmetric rank-one update for large-scale optimization |
| title | Sufficient descent three term conjugate gradient method via symmetric rank-one update for large-scale optimization |
| title_full | Sufficient descent three term conjugate gradient method via symmetric rank-one update for large-scale optimization |
| title_fullStr | Sufficient descent three term conjugate gradient method via symmetric rank-one update for large-scale optimization |
| title_full_unstemmed | Sufficient descent three term conjugate gradient method via symmetric rank-one update for large-scale optimization |
| title_short | Sufficient descent three term conjugate gradient method via symmetric rank-one update for large-scale optimization |
| title_sort | sufficient descent three term conjugate gradient method via symmetric rank-one update for large-scale optimization |
| topic | Unconstrained optimization; Symmetric rank-one update; Three-term conjugate gradient method; Memoryless update; Sufficient descent |
| url | http://psasir.upm.edu.my/id/eprint/53933/ http://psasir.upm.edu.my/id/eprint/53933/ http://psasir.upm.edu.my/id/eprint/53933/ http://psasir.upm.edu.my/id/eprint/53933/1/Sufficient%20descent%20three%20term%20conjugate%20gradient%20method%20.pdf |