A combination of potential reduction steps and steepest descent steps for solving convex programming problems

Yixun Shi. A combination of potential reduction steps and steepest descent steps for solving convex programming problems. Numerical Lin. Alg. with Applic., 9(3):195-203, 2002. [doi]

Abstract

Abstract is missing.