Login / Signup
A New Long-Step Path-Following Interior-Point Method with O(vnL) Iteration-Complexity Bound for Semidefinite Programming.
Zengzhe Feng
Liang Fang
Published in:
ICNC (6) (2009)
Keyphrases
</>
semidefinite programming
interior point methods
linear programming
worst case
primal dual
interior point
kernel matrix
semidefinite
lower bound
linear programming problems
maximum margin
upper bound
kernel methods
computational complexity
linear program
np hard
dynamic programming
special case