To avoid solving the integer programming problem (OP), as suggested in [1]}, the binary constraint in (OP) \(w \in \lbrace 0,1\rbrace ^n\)  can be relaxed to \(0 \le w \le \mathbf {e}\)  so that we obtain the partial gradient relaxed optimal thresholding (PGROT) algorithm.
