On extending kernel-based interior point algorithms for linear programming to convex quadratic second-order cone programming.
Yanfang LiXibo DuanJia GuPublished in: FSKD (2015)
Keyphrases
- interior point
- linear programming
- interior point methods
- semidefinite programming
- linear program
- convex optimization
- primal dual
- inequality constraints
- convex quadratic
- quadratic programming
- optimization problems
- optimal solution
- linear programming problems
- feasible solution
- nonnegative matrix factorization
- np hard
- semidefinite
- computational complexity
- column generation
- dynamic programming
- nonlinear programming
- evolutionary algorithm
- objective function
- approximation algorithms
- kernel methods
- linear systems
- special case
- support vector