  An abstract indefinite least squares problem with a quadratic constraint is
considered. This is a quadratic programming problem with one quadratic equality
constraint, where neither the objective nor the constraint are convex
functions. Necessary and sufficient conditions are found for the existence of
solutions.
