Edit: The norm constraint in the optimization problem in the below question was not there earlier. I apologize to the answerer user1551 who had to put his time and effort for my mistake.
Let $A$ and $B$ be two given hermitian positive semi-definite matrices, then what is the solution for \begin{align} \max_{||x||_2=1}\frac{x^HAx}{x^HBx+1}. \end{align} I am looking for closed form solutions. If the denominator didn't have that $1$, this is standard generalized rayleigh quotient and would be unbounded.
NOTES
I know how to solve it numerically. The trick is to re-write it as \begin{align} \max_{x,t}~&t\\ \text{s.t.}~~&x^H(A-tB)x>=t \end{align} Then find the largest $t$ such that there exists a $x$ which satisfies $x^H(A-tB)x>0$. A Bi-section search on $t$ will do the job.