Full Nesterov-Todd step infeasible interior-point method for symmetric optimization.
Guoyong GuMaryam ZangiabadiCornelis RoosPublished in: Eur. J. Oper. Res. (2011)
Keyphrases
- semidefinite programming
- interior point methods
- primal dual
- convex programming
- semidefinite
- saddle point
- linear programming
- nonlinear programming
- interior point
- interior point algorithm
- inequality constraints
- convex optimization
- kernel matrix
- linear programming problems
- linear program
- optimization problems
- coefficient matrix
- variational inequalities
- convergence rate
- maximum margin
- constrained optimization
- dynamic programming
- quadratic programming
- machine learning
- sufficient conditions
- knn
- learning algorithm