I have a ratio trace problem described as follows:
$\arg\max_{w} \text{trace}((w^tAw)\cdot \text{inv}(w^tBw))$, where A and B are full rank matrices.
This problem can be solved via generalized eigenvalue problem.
My question is that is this optimization problem convex or non-convex?