Quadratic programming with one negative eigenvalue is NP-hard.
Panos M. PardalosStephen A. VavasisPublished in: J. Glob. Optim. (1991)
Keyphrases
- quadratic programming
- np hard
- linear programming
- interior point methods
- linear program
- special case
- optimal solution
- approximation algorithms
- covariance matrix
- np complete
- least squares
- worst case
- lower bound
- computational complexity
- support vector machine
- ls svm
- data sets
- neural network
- probabilistic model
- incremental learning
- feature extraction