A Conjugate Gradient Method: Quantum Spectral Polak–Ribiére–Polyak Approach for Unconstrained Optimization ProblemsKin Keung Lai, Shashi Kant Mishra, Bhagwat Ram, Ravina Sharma
- General Mathematics
- Engineering (miscellaneous)
- Computer Science (miscellaneous)
Quantum computing is an emerging field that has had a significant impact on optimization. Among the diverse quantum algorithms, quantum gradient descent has become a prominent technique for solving unconstrained optimization (UO) problems. In this paper, we propose a quantum spectral Polak–Ribiére–Polyak (PRP) conjugate gradient (CG) approach. The technique is considered as a generalization of the spectral PRP method which employs a q-gradient that approximates the classical gradient with quadratically better dependence on the quantum variable q. Additionally, the proposed method reduces to the classical variant as the quantum variable q approaches closer to 1. The quantum search direction always satisfies the sufficient descent condition and does not depend on any line search (LS). This approach is globally convergent with the standard Wolfe conditions without any convexity assumption. Numerical experiments are conducted and compared with the existing approach to demonstrate the improvement of the proposed strategy.