I'm tying to solve a simple linear algebra problem. Let us assume that I have a vector space of dimension $R^N$. In that space I know two vectors $u$ and $v$. I want to find a vector $w$ that maximizes the inner product with $u$ but which minimizes the inner product with $v$ (ideally with a null product : $\int v(r)\cdot w(r)\cdot dr = 0$).
As far as I can understand, the vector $w$ is part of the hyperplan $D$ orthogonal to $v$, and is just the orthonormal projection $P$ of $u$ on it. We can requiere $w$ to be of unity norm for the unicity solution. Is there anyway to solve this problem from a generic set of vector $u$ and $v$ ? I think that this problem is a quite known problem that has been solved centuries ago but I didn't manage to find its name, does anyone know some documentations somewhere that formulate the algorithm to solve for it ?