Consider a parallelotope in R^n and some point "P" in R^n. What algorithms (except of brute force) can be suggested to find the closest vertex of paralleloptope to "P" ?

Is it NP ?

Parallelotope has 2^n vertex, not arbitrary 2^n point in R^n are vertex of paralleloptope, so clever algorithm should somehow use this additional information, while brute force search over 2^n points does not use.

==

Reformulation:

after choosing origin in the center of parallelotope we can come to the following algebraic version of the problem: minimize over x_i = {-1,+1} the quadratic form: \sum a_ij x_i x_j - \sum x_i v_i