The MOSEK Python optimizer API manual Version 7.0 (Revision 141)

260 APPENDIX A. API REFERENCE
Computes the violation of a solution for set of conic constraints.
Arguments
sub : int[]
An array of indexes of ¯X variables.
viol : double[]
viol[k] violation of the solution associated with sub[k]’th conic constraint.
whichsol : soltype
Selects a solution.
Description:
Let x ∗ be the value of variable x for the specified solution. For simplicity let us assume that x
is a member of quadratic cone, then the violation is computed as follows
{
max(0, ‖x2;n ‖ − x 1 )/ √ 2, x 1 ≥ − ‖x 2:n ‖ ,
‖x‖ ,
otherwise.
Both when the solution is a certificate of dual infeasibility or when it is a primal feasibible
solution the violation should be small.
A.2.113
Task.getpviolvar()
Task.getpviolvar(
whichsol,
sub,
viol)
Computes the violation of a primal solution for a list of x variables.
Arguments
sub : int[]
An array of indexes of x variables.
viol : double[]
viol[k] is the violation associated the solution for variable x j .
whichsol : soltype
Selects a solution.
Description:
Let x ∗ j be the value of variable x j for the specified solution. Then the primal violation of the
solution associated with variable x j is given by