Version info:
OS: Win10
Matlab: 9.8.0.1538580 (R2020a) Update 6
mosek: 9.2.38 (64-bit installed with .msi installer)
yalmip: R20200930
I'm trying the following MISDP problem with BMIBNB (the code is attached):
The problem is always feasible with trivial solution (W = 0).
The setting used. opts_BMIBNB = sdpsettings('solver','bmibnb','bmibnb.lowersolver','mosek','bmibnb.uppersolver','mosek','bmibnb.lpsolver','mosek','verbose',1);
I encountered error 1200 of mosek ([MSK_RES_ERR_IN_ARGUMENT] [A function argument is incorrect.]) as following:
* Starting YALMIP global branch & bound.
* Upper solver : MOSEK
* Lower solver : MOSEK
* LP solver : MOSEK
* -Extracting bounds from model
* -Perfoming root-node bound propagation
* -Calling upper solver *** Error(1200): param.MSK_IPAR_MIO_CONSTRUCT_SOL
Return code - 1200 [MSK_RES_ERR_IN_ARGUMENT] [A function argument is incorrect.]
(no solution found)
* -Branch-variables : 0
* -More root-node bound-propagation
* -Performing LP-based bound-propagation
* -And some more root-node bound-propagation
* Starting the b&b process
Node Upper Gap(%) Lower Open Time
*** Error(1200): param.MSK_IPAR_MIO_CONSTRUCT_SOL
Return code - 1200 [MSK_RES_ERR_IN_ARGUMENT] [A function argument is incorrect.]
1 : Inf NaN -1.86845E+02 0 21s
* Finished. Cost: Inf (lower bound: -186.8455, relative gap NaN%)
* Termination with all nodes pruned
* Timing: 1% spent in upper solver (2 problems solved)
* 1% spent in lower solver (1 problems solved)
* 73% spent in LP-based domain reduction (5480 problems solved)
* 2% spent in upper heuristics (341 candidates tried)
Both 'mosekdiag' and 'yalmiptest' run successfully, except that the 'infeasible QP' test case return an unknown error instead of infeasible.
This error also happens when using cutsdp with mosek, although bnb with mosek is fine. (I'm using BMIBNB hoping for better performance.)
A strange thing is that another machine(that I have limited access to) with the same version of everything can run the exact same code with no error.
I'm suspecting some set-up mistakes, but I don't know where to look into.
Any help is appreciated. Thanks.