Avoiding numerical cancellation in the interior point method for solving semidefinite programs.

Published in: Math. Program. (2003)

Keyphrases

semidefinite
interior point methods
quadratic programming
linear programming problems
semidefinite programming
solving problems
convex optimization
linear programming
linear program
primal dual
computationally intensive
feature set
sufficient conditions
kernel matrix
maximum margin