) infeasible interior-point algorithm for semidefinite optimization.
Hossein MansouriCornelis RoosPublished in: Numer. Algorithms (2009)
Keyphrases
- semidefinite
- interior point methods
- interior point algorithm
- semidefinite programming
- primal dual
- linear programming
- convex optimization
- quadratic programming
- linear program
- sufficient conditions
- convex relaxation
- higher dimensional
- upper bound
- approximation algorithms
- convex sets
- solving problems
- kernel matrix
- machine learning
- globally optimal
- column generation
- learning algorithm