def _solveFeasibleProjection(self, points):
m, n = self.A.shape
bestResult = np.inf
for i in range(m):
if i in self.ban_constraints:
result = np.inf
else:
ai = self.A[i]
bi = self.b[i]
result = self._project_to_hyperplane(points, ai, bi)
if result < bestResult:
bestResult = result
self.dual = np.zeros(m)
self.dual[i] = 1.0 / np.linalg.norm(ai, np.inf)
self.c = ai / np.linalg.norm(ai, np.inf)
self._solved = True
#self.dual = self.dual.T.tolist()[0]
self.c = self.c.tolist()[0]
self.error = bestResult
return result
评论列表
文章目录