A q-Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization problems
Abstract A Polak–Ribière–Polyak (PRP) algorithm is one of the oldest and popular conjugate gradient algorithms for solving nonlinear unconstrained optimization problems. In this paper, we present a q-variant of the PRP (q-PRP) method for which both the sufficient and conjugacy conditions are satisfi...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2021-01-01
|
| Series: | Journal of Inequalities and Applications |
| Subjects: | |
| Online Access: | https://doi.org/10.1186/s13660-021-02554-6 |