  A quadratically constrained quadratic programming problem is considered in a
Hilbert space setting, where neither the objective nor the constraint are
convex functions. Necessary and sufficient conditions are provided to guarantee
that the problem admits solutions for every initial data (in an adequate set).
