New complexity analysis of a full Nesterov-Todd step infeasible interior-point algorithm for symmetric optimization.
Behrouz KheirfamNezam Mahdavi-AmiriPublished in: Kybernetika (2013)
Keyphrases
- complexity analysis
- interior point algorithm
- primal dual
- semidefinite programming
- saddle point
- interior point methods
- linear programming
- convex concave
- linear program
- convex optimization
- theoretical analysis
- approximation algorithms
- lower bound
- variational inequalities
- convergence rate
- first order logic
- kernel matrix
- np hard
- search space
- simplex method
- special case
- quadratic programming
- integer programming
- machine learning
- computational complexity
- optimal solution
- artificial intelligence