A feasible primal-dual interior point method for linear semidefinite programming.
Imene TouilDjamel BenterkiAdnan YassinePublished in: J. Comput. Appl. Math. (2017)
Keyphrases
- semidefinite programming
- interior point methods
- primal dual
- semidefinite
- linear programming
- linear program
- affine scaling
- convex optimization
- interior point
- interior point algorithm
- convex programming
- linear programming problems
- convergence rate
- approximation algorithms
- variational inequalities
- quadratic programming
- nonlinear programming
- simplex method
- optimal solution
- kernel matrix
- low rank
- worst case
- dynamic programming
- training set