A numerical feasible interior point method for linear semidefinite programs.

Djamel Benterki Jean-Pierre Crouzeix Bachir Merikhi

Published in: RAIRO Oper. Res. (2007)

Keyphrases

semidefinite
interior point methods
semidefinite programming
convex optimization
linear programming
quadratic programming
primal dual
linear program
computationally intensive
solving problems
linear systems
convex relaxation
higher dimensional
total variation
kernel matrix
convex sets