I am trying to optimize a high dimension sparse QCQP problem and I have encountered the numerical issue.
May I ask where do those statistics come from?
Whats the Matrix in “Matrix coefficient range” and what is the RHS coefficient range?
Linear constraint matrix : 82820 Constrs, 132512 Vars, 393928 NZs
Quadratic constraints : 33128 Constrs, 99384 NZs
Matrix coefficient range : [ 4.30793e-06, 39.5285 ]
Objective coefficient range : [ 0.5, 400 ]
Variable bound range : [ 0, 0 ]
RHS coefficient range : [ 1, 225000 ]