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

A.2. CLASS TASK 211
Description:
If a basic solution is available and it defines a nonsingular basis, then this function computes the
1-norm estimate of the basis matrix and an 1-norm estimate for the inverse of the basis matrix.
The 1-norm estimates are computed using the method outlined in [19].
By defintion the 1-norm condition number of a matrix B is defined as
κ 1 (B) := ‖B‖ 1
∥ ∥ B −1∥ ∥ .
Moreover, the larger the condition number is the harder it is to solve linear equation systems
involving B. Given estimates for ‖B‖ 1 and ∥ ∥ B
−1 ∥ ∥ 1 it is also possible to estimate κ 1 (B).
A.2.13
Task.checkconvexity()
Task.checkconvexity()
Checks if a quadratic optimization problem is convex.
Description:
See also
This function checks if a quadratic optimization problem is convex. The amount of checking is
controlled by iparam.check convexity.
The function throws an exception if the problem is not convex.
• iparam.check convexity Specify the level of convexity check on quadratic problems
A.2.14
Task.checkmem()
Task.checkmem(
file,
line)
Checks the memory allocated by the task.
Arguments
file : str
File from which the function is called.
line : int
Line in the file from which the function is called.
Description:
Checks the memory allocated by the task.