Quadratic programming with one negative eigenvalue is NP-hard

Overview of attention for article published in Journal of Global Optimization, March 1991

Altmetric Badge

About this Attention Score

In the top 25% of all research outputs scored by Altmetric
Among the highest-scoring outputs from this source (#15 of 306)
High Attention Score compared to outputs of the same age (89th percentile)

Mentioned by

patent: 1 patent
wikipedia: 4 Wikipedia pages

q&a: 1 Q&A thread

Citations

dimensions_citation: 344 Dimensions

Readers on

mendeley: 79 Mendeley

Summary Patents Wikipedia Q&A Dimensions citations

So far, Altmetric has seen 1 Q&A post.

Is global non-convex optimization NP-complete?

Posted by wjmccann, at cs.stackexchange.com, 26 Mar 2018

Assume I have some non-convex function $f(x_1, x_2, ...)$ and I want to optimize it to find a global minimum. I feel like it is…

This page shows the most recent Q&A posts that mention this research output.

Click here to find out how to access more activity.