The problem status is dual-infeasible

i use mosek solver to solve the problem, but the problem status is dual-infeasible and the solution status is dual-infeasible-cer?

MOSEK Version 9.1.9 (Build date: 2019-11-21 11:34:40)
Copyright © MOSEK ApS, Denmark. WWW: mosek.com
Platform: Windows/64-X86

Problem
Name :
Objective sense : min
Type : CONIC (conic optimization problem)
Constraints : 75
Cones : 39
Scalar variables : 153
Matrix variables : 0
Integer variables : 0

Optimizer started.
Presolve started.
Linear dependency checker started.
Linear dependency checker terminated.
Eliminator started.
Freed constraints in eliminator : 8
Eliminator terminated.
Eliminator - tries : 1 time : 0.00
Lin. dep. - tries : 1 time : 0.00
Lin. dep. - number : 0
Presolve terminated. Time: 0.02
Problem
Name :
Objective sense : min
Type : CONIC (conic optimization problem)
Constraints : 75
Cones : 39
Scalar variables : 153
Matrix variables : 0
Integer variables : 0

Optimizer - threads : 6
Optimizer - solved problem : the primal
Optimizer - Constraints : 24
Optimizer - Cones : 39
Optimizer - Scalar variables : 132 conic : 114
Optimizer - Semi-definite variables: 0 scalarized : 0
Factor - setup time : 0.00 dense det. time : 0.00
Factor - ML order time : 0.00 GP order time : 0.00
Factor - nonzeros before factor : 66 after factor : 74
Factor - dense dim. : 0 flops : 7.60e+02
ITE PFEAS DFEAS GFEAS PRSTATUS POBJ DOBJ MU TIME
0 1.0e+00 1.6e+04 3.3e+01 0.00e+00 3.131160141e+01 -6.750000015e-01 1.0e+00 0.02
1 1.5e-01 2.4e+03 1.3e+01 -1.01e+00 2.112803151e+01 -5.943364727e+00 1.5e-01 0.11
2 2.5e-02 4.0e+02 5.4e+00 -1.03e+00 -4.916335269e+01 -4.167356247e+01 2.5e-02 0.11
3 2.9e-03 4.5e+01 1.9e+00 -1.01e+00 -7.239950417e+02 -3.812497559e+02 2.9e-03 0.11
4 5.2e-04 8.1e+00 8.3e-01 -1.05e+00 -4.570561765e+03 -2.281329624e+03 5.2e-04 0.11
5 6.8e-05 1.1e+00 3.0e-01 -1.04e+00 -3.462086396e+04 -1.692257623e+04 6.8e-05 0.11
6 2.6e-05 4.0e-01 1.8e-01 -1.01e+00 -9.227613218e+04 -4.512524955e+04 2.6e-05 0.11
7 8.3e-06 1.3e-01 1.1e-01 -1.01e+00 -2.885206970e+05 -1.403307846e+05 8.3e-06 0.13
8 2.0e-06 3.1e-02 5.1e-02 -9.95e-01 -1.195441118e+06 -5.817558331e+05 2.0e-06 0.13
9 4.2e-07 6.5e-03 2.4e-02 -1.00e+00 -5.613045689e+06 -2.724446452e+06 4.2e-07 0.13
10 4.2e-07 6.4e-03 2.3e-02 -1.00e+00 -5.687303214e+06 -2.760533594e+06 4.2e-07 0.13
11 4.1e-07 6.4e-03 2.3e-02 -1.00e+00 -5.763242050e+06 -2.797437377e+06 4.1e-07 0.14
12 4.0e-07 5.6e-03 2.2e-02 -1.00e+00 -6.499069442e+06 -3.154680434e+06 3.6e-07 0.14
13 4.0e-07 5.6e-03 2.2e-02 -1.00e+00 -6.499069442e+06 -3.154680434e+06 3.6e-07 0.14
14 4.0e-07 5.6e-03 2.2e-02 -1.00e+00 -6.499069442e+06 -3.154680434e+06 3.6e-07 0.14
Optimizer terminated. Time: 0.17

Interior-point solution summary
Problem status : DUAL_INFEASIBLE
Solution status : DUAL_INFEASIBLE_CER
Primal. obj: -2.1506927434e+00 nrm: 1e+02 Viol. con: 2e-06 var: 9e-07 cones: 2e-07
Optimizer summary
Optimizer - time: 0.17
Interior-point - iterations : 15 time: 0.14
Basis identification - time: 0.00
Primal - iterations : 0 time: 0.00
Dual - iterations : 0 time: 0.00
Clean primal - iterations : 0 time: 0.00
Clean dual - iterations : 0 time: 0.00
Simplex - time: 0.00
Primal simplex - iterations : 0 time: 0.00
Dual simplex - iterations : 0 time: 0.00
Mixed integer - relaxations: 0 time: 0.00


Status: Infeasible
Optimal value (cvx_optval): +Inf

Mosek solved the dual (you didn’ show that beginning part of the output), and concluded it is dual infeasible; therefore, CVX reported it is (primal) infeasible.

All the advice in https://yalmip.github.io/debugginginfeasible/ except for section 1, applies to CVX.