Everything about your problem, both the objective and the constraint, are highly non-convex.
Maybe you can relax this formula using SDP and then using the Dinkelbach algorithm to solve it?
Everything about your problem, both the objective and the constraint, are highly non-convex.
Maybe you can relax this formula using SDP and then using the Dinkelbach algorithm to solve it?