A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints.
Fabián Flores BazánGabriel CárcamoPublished in: Math. Program. (2014)
Keyphrases
- quadratic programming
- quadratic program
- mathematical program
- linear programming
- nonlinear programming
- objective function
- karush kuhn tucker
- linear constraints
- equality constraints
- linear program
- optimality conditions
- interior point methods
- convex optimization
- stationary points
- support vector machine
- optimization problems
- line search
- constrained optimization
- semidefinite programming
- convex functions
- optimal solution
- pairwise
- maximum margin
- linear svm
- feature space
- dynamic programming
- approximation algorithms
- np hard
- training data