Thank you very much for the solution! Indeed, it works perfectly!
First off, my problem is a strictly convex QP. The piece of code that takes hours to complete is exactly here (I'm pasting it exactly as it appears in my code):
controller{iMode} = optimizer(F, obj, sdpsettings('verbose',1, 'solver', 'cplex'),x{1},u{1});
The size of the problem can be rather big, e.g. F counts around 2,500 linear inequalities involving usually 12,000~20,000 variables. The vector x is of dimension 12,000 and the size of u is around 2,000.
Do you want me to send you some additional information? I can make a MAT file with the objective and the constraints of the problem and send it to you.