Preconditioned Conjugate Gradient Method for Quadratic Programming

Abstract

In this thesis, we study the preconditioned conjugate gradient (PCG) method for the equality constrained quadratic programming, and discuss the multiple projections which is able to accelerate the convergence to a solution and guarantee the numerical stability. In addition, we apply the PCG algorithms with real world problems.