Infeasible constraint-reduced interior-point methods for linear optimization.
Meiyun Y. HeAndré L. TitsPublished in: Optim. Methods Softw. (2012)
Keyphrases
- interior point methods
- quadratic programming
- semidefinite
- inequality constraints
- convex programming
- linear programming
- convex optimization
- semidefinite programming
- linear systems
- linear program
- interior point
- semi infinite
- linear constraints
- primal dual
- cutting plane method
- linear programming problems
- quadratically constrained quadratic
- quadratic program
- extreme points
- convex relaxation
- solving problems
- support vector machine
- computational complexity
- nonlinear programming
- learning algorithm
- computationally intensive