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...

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...

Noyaux des sous-espaces de Banach réflexif d’un espace localement convexe -- An abstract theorem for planning procedures -- Estimation and regularity for the maximum lower solution of a unilateral problem -- Conjugacy in quasiconvex analysis -- Duality: some results in asymptotical...