Auslender, Alfred; Héctor C. - In: Mathematical Methods of Operations Research 63 (2006) 2, pp. 195-219
In this paper we present penalty and barrier methods for solving general convex semidefinite programming problems. More precisely, the constraint set is described by a convex operator that takes its values in the cone of negative semidefinite symmetric matrices. This class of methods is an...