On the implementation of primal-dual interior-point methods for semidefinite programming problems derived from the KYP lemma.
Lieven VandenbergheV. BalakrishnanRagnar WallinAnders HanssonPublished in: CDC (2003)
Keyphrases
- semidefinite programming
- interior point methods
- primal dual
- interior point
- convex programming
- linear programming
- linear programming problems
- semidefinite
- convex optimization
- variational inequalities
- affine scaling
- linear program
- solving problems
- quadratically constrained quadratic
- approximation algorithms
- convergence rate
- quadratic programming
- kernel matrix
- simplex method
- np hard
- algorithm for linear programming
- objective function
- maximum margin
- machine learning
- linear systems
- linear combination