An accelerated interior point method whose running time depends only on A (extended abstract).
Stephen A. VavasisYinyu YePublished in: STOC (1994)
Keyphrases
- extended abstract
- interior point methods
- convex optimization
- linear programming
- primal dual
- linear program
- semidefinite programming
- quadratic programming
- interior point algorithm
- inequality constraints
- linear programming problems
- solving problems
- coefficient matrix
- computationally intensive
- cutting plane method
- linear systems
- low rank
- approximation algorithms
- dimensionality reduction
- computational complexity