Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity.
Florian A. PotraPublished in: SIAM J. Optim. (2014)
Keyphrases
- interior point methods
- quadratic programming
- convex optimization
- linear program
- semidefinite programming
- primal dual
- linear programming
- interior point
- convex programming
- computational complexity
- worst case
- solving problems
- computationally intensive
- linear programming problems
- maximum likelihood
- semidefinite
- objective function