A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization.
G. Q. WangC. J. YuKok Lay TeoPublished in: Appl. Math. Comput. (2013)
Keyphrases
- semidefinite programming
- interior point methods
- inequality constraints
- convex quadratic
- semidefinite
- nonlinear programming
- convex programming
- linear programming
- primal dual
- constrained optimization
- kernel matrix
- maximum margin
- convex optimization
- quadratic programming
- optimality conditions
- linear program
- cross validation
- dynamic programming