Yuriy Zinchenko

Hello Ibtissam,   this is too generic of a question to give a concrete answer, but given that you are starting "from scratch" I suggest you look at a few of our modelling examples discussed here, h...

Hello Soufyan: the names "interior-point" and "barrier" are often synonymous when referring to optkmizaiotn algorithms, although I cannot guarantee that this is exactly what Matlab's solver is usin...

You should really consider re-formulating your model, as the reported ranges, especially for the quadratic,  > Matrix range [2e-09, 6e+01]> Objective range [8e-04, 5e+03]> QObjective range [2e-09, ...

You should check if the incumbent was found first, before querying for the X property.  You can do this by checking SolCount, https://www.gurobi.com/documentation/9.0/refman/solcount.html#attr:SolC...

Hello Leo: The differences are likely to come from the way AA' is factored inside the barrier. You can see that by comparing the 'lean' and 'inflated' log lines, focusing on number of non-zeros (th...

Yes, the incumbent (if such is found) will be accessible through 'x' field of you variables.

What do you mean by |x' - x| \leq \delta ?   Are you comparing x and x' just component by component --meaning, you are looking for the largest L1-ball that can fit inside a polyhedron-- or are you ...

Yes, absolutely.  Although we do not have an explicit '\ell-1' construct to accommodate the above norm, we have the absolute value helper function, e.g.,  https://www.gurobi.com/documentation/9.0/r...

We have no out-of-the-box functionality for this, however it should be possible to program something like this in Python.  Chances are you may benefit from using callbacks (to get the incumbent val...

In its current form, no, but ... Although Gurobi does not implement barrier or any other algorithms for SDP, if you have a toy-sized SDP model, we can still do something with it starting from the u...