On the Complexity of a Class of Projective Interior Point Methods.

Donald Goldfarb Dong X. Shaw

Published in: Math. Oper. Res. (1995)

Keyphrases

interior point methods
linear programming
primal dual
convex optimization
semidefinite programming
computational complexity
linear program
worst case
linear programming problems
machine learning
np hard
sufficient conditions
linear combination
class labels
quadratic programming
cutting plane method