code: private DoubleMatrix1D findOneRoot(DoubleMatrix2D A, DoubleMatrix1D b) throws Exception{
  		return originalProblem.findEqFeasiblePoint(A, b);
  	}
docs: Just looking for one out of all the possible solutions.
  @see "Convex Optimization, C.5 p. 681".