Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence.
Chee-Khian SimPublished in: Comput. Optim. Appl. (2019)
Keyphrases
- semidefinite programming
- interior point
- interior point methods
- semidefinite
- primal dual
- linear programming problems
- linear programming
- convergence rate
- kernel matrix
- linear program
- maximum margin
- approximation algorithms
- worst case
- convex optimization
- image processing
- image restoration
- simplex method
- convergence analysis
- computational complexity