Quadratic programming with one negative eigenvalue is NP-hard
- 1 January 1991
- journal article
- research article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 1 (1) , 15-22
- https://doi.org/10.1007/bf00120662
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Quadratic programming is in NPInformation Processing Letters, 1990
- Polynomial time algorithms for some classes of constrained nonconvex quadratic problemsOptimization, 1990
- Checking local optimality in constrained quadratic programming is NP-hardOperations Research Letters, 1988
- Some NP-complete problems in quadratic and nonlinear programmingMathematical Programming, 1987
- Constrained Global Optimization: Algorithms and ApplicationsPublished by Springer Nature ,1987
- Methods for Global Concave Minimization: A Bibliographic SurveySIAM Review, 1986
- Computationally Related ProblemsSIAM Journal on Computing, 1974