I'm studying
$$ F( (x,Q) ) = \langle x,Q^{-1}x\rangle $$
considered over $\mathbb{R}^n\times\mathbb{R}^{n\times n}_+$, where $\mathbb{R}^{n\times n}_+$ is the set of all positive definite $n\times n$ matrices. Here, $\langle x,y\rangle$ stands for the dot product.
I'm trying to prove that $F$ will be convex when considered over this set. That is, it's obvous that $F$ is convex in $x$ with fixed $Q$ (and in $Q$ with fixed $x$), but the trick is to prove that it will be convex with respect to the pair $(x,Q)$. It can be straightforwardly checked for $n=1$ (considering the Hessian), but how can it be done for an arbitrary $n$?