I am trying to solve a mixed integer convex programming using CVX Mosek. My program works for smaller number of integer variables but does not converge for a large number of integer variables. Since CVX Mosek shows improving feasible solutions in each step, I can see that the program is trying to go close to lowest feasible solution (it's a minimization problem) in each iteration. However, it can't reach since no. of variables are too high. I want to change CVX stopping criterion to the following:
STOP WHEN feasible solution <= A * global lower bound.
Here, A is a user-defined constant. If A is 2, i.e. user is satisfied with 50% gap from optimality. I know that Gurobi has a parameter named 'MIPGAP' to handle this http://www.gurobi.com/documentation/5.5/reference-manual/node846#parameter. Does Mosek have any setting option like this?
Thanks,
Nazmul
To post to this group, send email to mo...@googlegroups.com.--
You received this message because you are subscribed to a topic in the Google Groups "mosek" group.
To unsubscribe from this topic, visit https://groups.google.com/d/topic/mosek/607AxEQtVW4/unsubscribe.
To unsubscribe from this group and all its topics, send an email to mosek+un...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.