A New Strategy in the Complexity Analysis of an Infeasible-Interior-Point Method for Symmetric Cone Programming.
Ximei YangHongwei LiuYinkui ZhangPublished in: J. Optim. Theory Appl. (2015)
Keyphrases
- complexity analysis
- interior point methods
- convex optimization
- theoretical analysis
- semidefinite
- linear program
- linear programming
- inequality constraints
- primal dual
- interior point algorithm
- computational complexity
- lower bound
- first order logic
- semidefinite programming
- positive semidefinite matrices
- solving problems
- quadratic programming
- coefficient matrix
- machine learning
- convex sets
- support vector machine
- knowledge base