A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization.
Mohamed AchacheLoubna GuerraPublished in: Appl. Math. Comput. (2014)
Keyphrases
- semidefinite programming
- primal dual
- interior point algorithm
- semidefinite
- interior point methods
- linear programming
- inequality constraints
- nonlinear programming
- convex optimization
- linear program
- saddle point
- approximation algorithms
- convex programming
- convergence rate
- variational inequalities
- simplex method
- convex functions
- np hard
- quadratic programming
- low rank
- quadratic program