The problem of minimizing the maximum of two strongly convex quadratic functions on Rn is considered. It is shown that in some cases this problem is equivalent to finding the positive root of a polynomial of the degree 2n or less.