Global convergence of the affine scaling algorithm for primal degenerate strictly convex quadratic programming problems

This paper deals with global convergence of the affine scaling algorithm for strictly convex QP problems satisfying a dual nondegeneracy condition. By means of the local Karmarkar potential function which was successfully applied to demonstrate global convergence of the affine scaling algorithm for LP, it shows global convergence of the algorithm when the step-size 1/8 is adopted without requiring any primal nondegeneracy condition.