On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP.
Florian A. PotraJosef StoerPublished in: SIAM J. Optim. (2009)
Keyphrases
- interior point methods
- quadratic programming
- convex optimization
- convex programming
- primal dual
- linear program
- linear programming
- semidefinite programming
- special case
- interior point
- quadratically constrained quadratic
- computationally intensive
- cutting plane method
- solving problems
- computational complexity
- learning algorithm
- dimensionality reduction
- worst case
- high resolution