An Improved and Simplified Full-Newton Step O(n) Infeasible Interior-Point Method for Linear Optimization.
C. RoosPublished in: SIAM J. Optim. (2015)
Keyphrases
- interior point methods
- quadratic programming
- semidefinite
- convex programming
- convex optimization
- linear programming
- linear systems
- linear program
- semidefinite programming
- interior point algorithm
- primal dual
- cutting plane method
- linear programming problems
- inequality constraints
- coefficient matrix
- analytic center
- convex relaxation
- support vector machine
- solving problems
- ls svm
- computationally intensive
- newton method
- optimization problems