1991
DOI: 10.1007/bf00120662
|View full text |Cite
|
Sign up to set email alerts
|

Quadratic programming with one negative eigenvalue is NP-hard

Abstract: We show that the problem of minimizing a concave quadratic function with one concave direction is NP-hard. This result can be interpreted as an attempt to understand exactly what makes nonconvex quadratic programming problems hard. Sahni in 1974 [8] showed that quadratic programming with a negative definite quadratic term (n negative eigenvalues) is NP-hard, whereas Kozlov, Tarasov and Hacijan [2] showed in 1979 that the ellipsoid algorithm solves the convex quadratic problem (no negative eigenvalues) in polyn… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
221
0

Year Published

2005
2005
2020
2020

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 403 publications
(221 citation statements)
references
References 8 publications
0
221
0
Order By: Relevance
“…This has been a popular approach in the practice and literature see (Jorion, 2003). However, this would create a non-linearity in the objective as the variance of the difference of the returns of the tracking and benchmark portfolios would need to be minimized and in conjunction with cardinality constraint requirements would result in a quadratic non-linear integer program which is known to be very challenging to solve see (Bertsimas and Shioda, 2009;Pardalos and Vavasis, 1991).…”
Section: Basic Cluster-based Index Tracking Modelmentioning
confidence: 99%
“…This has been a popular approach in the practice and literature see (Jorion, 2003). However, this would create a non-linearity in the objective as the variance of the difference of the returns of the tracking and benchmark portfolios would need to be minimized and in conjunction with cardinality constraint requirements would result in a quadratic non-linear integer program which is known to be very challenging to solve see (Bertsimas and Shioda, 2009;Pardalos and Vavasis, 1991).…”
Section: Basic Cluster-based Index Tracking Modelmentioning
confidence: 99%
“…The maximization of x T Wx under the given constraints is known to be NP-hard, if W has positive eigenvalues (Gibbons et al, 1997;Pardalos and Vavasis, 1991). This is the case in our application as W is not guaranteed to be negative semi-definite.…”
Section: Replicator Dynamicsmentioning
confidence: 99%
“…In this case, matrix is an indefinite matrix: therefore, optimization problem (13) is a non-convex optimization problem. Such kind of problems is NP-hard [37]. There are algorithms for obtaining the global optimum of non convex quadratic optimization problems, such as the LPCC method [38] and the globally solving method based on completely positive programming [39].…”
Section: Optimizationmentioning
confidence: 99%