An Interior Point Cutting Plane Method for the Convex Feasibility Problem with Second-Order Cone Inequalities.
Mohammad R. OskoorouchiJean-Louis GoffinPublished in: Math. Oper. Res. (2005)
Keyphrases
- cutting plane method
- interior point
- interior point methods
- analytic center
- convex optimization
- primal dual
- linear programming
- semidefinite
- valid inequalities
- semidefinite programming
- linear program
- sufficient conditions
- linear programming problems
- quadratic programming
- nonnegative matrix factorization
- solving problems
- computationally intensive
- cutting plane algorithm
- extreme points
- variational inequalities
- convex relaxation
- low rank
- approximation algorithms
- convergence rate