A primal-dual predictor-corrector interior-point method for symmetric cone programming with O(√r log ϵ-1) iteration complexity.
M. Sayadi ShahrakiHossein MansouriMaryam ZangiabadiPublished in: Int. J. Comput. Math. (2017)
Keyphrases
- primal dual
- interior point methods
- linear programming
- convex optimization
- linear program
- interior point algorithm
- semidefinite
- semidefinite programming
- linear programming problems
- approximation algorithms
- convex programming
- convergence rate
- variational inequalities
- interior point
- algorithm for linear programming
- objective function
- worst case
- quadratic programming
- inequality constraints
- analytic center
- solving problems
- simplex method
- computational complexity
- image processing
- dynamical systems
- special case