Finite Algorithms for Solving Quasi-Convex Quadratic Programs

Abstract : The paper considers the question of why some convex quadratic programming algorithms fail and others succeed when applied to nonconvex quasi-convex quadratic programs. Several algorithms are identified as being capable of solving quasi-convex quadratic programs using only a finite number of arithmetic and logical operations. These algorithms are all primal feasible, pivot algorithms.