Re: quadratic minimization: analytical solutions

y_granik_at_yahoo.com
Date: 12/31/04 

Date: 31 Dec 2004 15:37:43 -0800

Peter,

NP-hard does not mean it cannot be solved analytically for small N. You
just have
to exhaust all combinations.

In you example Q=[-1 0 ; 0 -1 ] we just have to compare f(x) at the
corners
[0 1], [0 0], [1 0] and [1 1].

So when you say "any situation", do you mean these four?
Thank you,

Yuri

Quantcast