An algorithm for indefinite quadratic programming with convex constraints.
Le Dung MuuWerner OettliPublished in: Oper. Res. Lett. (1991)
Keyphrases
- quadratic programming
- computational complexity
- learning algorithm
- dynamic programming
- convex hull
- expectation maximization
- similarity measure
- high dimensional
- improved algorithm
- linear programming
- support vector machine svm
- path consistency
- parameter estimation
- least squares
- probabilistic model
- search space
- training data