Checking local optimality in constrained quadratic programming is NP-hard
- 1 February 1988
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 7 (1), 33-35
- https://doi.org/10.1016/0167-6377(88)90049-1
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- Constrained Global Optimization: Algorithms and ApplicationsPublished by Springer Nature ,1987
- The complexity of analog computationMathematics and Computers in Simulation, 1986
- Second Order Conditions for Constrained MinimaSIAM Journal on Applied Mathematics, 1967