- n = self._K.dimension()
- self._L = matrix(L, (n,n))
- self._e1 = matrix(e1, (n,1)) # TODO: check that e1 and e2
- self._e2 = matrix(e2, (n,1)) # are in the interior of K...
- self._h = matrix(0, (2*n,1), 'd')
- self._b = matrix(1, (1,1), 'd')
- self._c = matrix([-1] + [0]*n, (n+1,1), 'd')
- self._G = append_row(append_col(matrix(0,(n,1)), -identity(n)),
+ self._e1 = matrix(e1, (K.dimension(), 1))
+ self._e2 = matrix(e2, (K.dimension(), 1))
+
+ if not K.contains_strict(self._e1):
+ raise ValueError('the point e1 must lie in the interior of K')
+ if not K.contains_strict(self._e2):
+ raise ValueError('the point e2 must lie in the interior of K')
+
+ self._L = matrix(L, (K.dimension(), K.dimension()))
+ self._b = matrix([1], tc='d')
+ # A column of zeros that fits K.
+ zero = matrix(0, (K.dimension(), 1), tc='d')
+ self._h = matrix([zero, zero])
+ self._c = matrix([-1, zero])
+ self._G = append_row(append_col(zero, -identity(K.dimension())),