MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Consider the problem:

$\textrm{max}\;\; x^T Q x$

subject to $||x||_\infty \leq 1$, where $Q$ is a positive definite matrix.

I believe this problem is NP-hard (although I have only found hardness results for positive semi-definite matrices).

Consider now the following algorithm. Let $q_1$ be the largest eigenvector of $Q$. Let the solution $x$ be defined by $x_i = \textrm{sign}(q_{1i})$.

When does this algorithm fail? So far, I have looked for examples in 2d or 3d, and have not found any.

Note that the intuition here is that $x$ should be as close as possible to $q_1$.

share|cite|improve this question
What is $q_i??$ – Igor Rivin Apr 4 '12 at 6:08
Sorry, I meant $q_{1i}$, the $i$-th entry of the largest eigenvector $q_1$. The question is now edited. – Woland Apr 4 '12 at 19:09

The reference where all is revealed is Bodlaender, Gritzman, Klee, Van Leeuwen

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.