Login / Signup

Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems.

Martin PreißJosef Stoer
Published in: Math. Program. (2004)
Keyphrases
  • semidefinite
  • linear complementarity problem
  • interior point
  • convex relaxation
  • learning algorithm
  • support vector machine
  • least squares
  • primal dual
  • semidefinite programming