Sparsity in convex quadratic programming with interior point methods.
Csaba MészárosPublished in: Optim. Methods Softw. (2006)
Keyphrases
- interior point methods
- convex quadratic programming
- primal dual
- convex optimization
- variational inequalities
- linear programming
- interior point
- semidefinite programming
- linear program
- quadratic programming
- high dimensional
- computationally intensive
- solving problems
- sparse representation
- semidefinite
- machine learning
- convergence rate
- convex sets
- approximation algorithms
- np hard
- feature space