A new class of polynomial primal-dual methods for linear and semidefinite optimization.

Jiming Peng Cornelis Roos Tamás Terlaky

Published in: Eur. J. Oper. Res. (2002)

Keyphrases

semidefinite
semidefinite programming
primal dual
convex optimization problems
interior point
interior point methods
convex optimization
optimization methods
least squares
support vector
graph cuts
class labels
approximation algorithms
linear programming problems