Thank you for your answers.
Currently I am solving this two convex problems one after the other:
[x*,y*] = argmin f(x,y)
s.t.
x \in X
y \in Y(x)
y_opt = argmin g(y)
s.t.
y \in Y(x*)
Actually, there are a few cases in which the first problem is solved, but the second one cannot be solved by Gurobi due to infeasibility, even if I set the initial guess as y = y*.
When a solution to the second problem cannot be found, if I take a look to the 'qcslack' field of the first problem's result, there are some negative slack variables.
Is Gurobi using different tolerances for asserting the feasibility of the initial guess and that of a computed solution?