A New Complexity Analysis for Full-Newton Step Infeasible Interior-Point Algorithm for Horizontal Linear Complementarity Problems.
Behrouz KheirfamPublished in: J. Optim. Theory Appl. (2014)
Keyphrases
- complexity analysis
- interior point algorithm
- interior point
- linear complementarity problem
- interior point methods
- primal dual
- linear programming
- convex optimization
- linear program
- semidefinite programming
- variational inequalities
- semidefinite
- theoretical analysis
- linear programming problems
- simplex method
- lower bound
- quadratic programming
- sufficient conditions
- integer programming
- approximation algorithms
- convergence rate
- first order logic
- np hard
- machine learning
- convex relaxation
- least squares
- support vector machine
- image processing