The global proof of the Polak–Ribière–Polak algorithm under the YWL inexact line search technique
Abstract This paper presents a new proof method about the paper (Yuan et al. in Appl. Math. Model. 47:811–825, 2017). In the proof, the global convergence of the Polak–Ribière–Polak algorithm is established without these two assumptions dkTgk<0 $d_{k}^{T}g_{k}<0$ and gk+1dk≤−σ1gkTdk $g_{k+1}d_...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2019-07-01
|
| Series: | Journal of Inequalities and Applications |
| Subjects: | |
| Online Access: | http://link.springer.com/article/10.1186/s13660-019-2148-x |