Superlinearly Convergent O(√(n) L)-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem.
Kevin A. McShanePublished in: SIAM J. Optim. (1994)
Keyphrases
- interior point
- linear programming
- linear complementarity problem
- interior point methods
- linear program
- primal dual
- semidefinite programming
- complementarity problems
- convex optimization
- nonnegative matrix factorization
- dynamic programming
- objective function
- semidefinite
- linear programming problems
- feasible solution
- quadratic programming
- simplex method
- optimal solution
- column generation
- np hard
- integer programming
- linear systems
- total variation
- sensitivity analysis