Max-min feasible point pursuit for non-convex QCQP.
Charilaos I. KanatsoulisNicholas D. SidiropoulosPublished in: ACSSC (2015)
Keyphrases
- max min
- quadratic program
- quadratically constrained quadratic
- min max
- multiple kernel learning
- convex optimization
- convex relaxation
- hill climbing
- linear constraints
- optimal kernel
- interior point methods
- evolutionary algorithm
- kernel learning
- feature space
- semidefinite program
- robust optimization
- semidefinite programming
- quadratic programming
- mixed integer
- linear program
- linear programming
- genetic algorithm
- maximum margin
- convergence rate
- feasible solution
- kernel methods
- dynamic programming