“…Secondly, it is able to drop and add many constraints from and to the active set at each iteration. Due to its structural and theoretical advantages, various projection-type methods [8,9,12,21,25,27,28], such as the basic projection algorithm, the extragradient algorithm and its variants, and the hyperplane projection algorithm, have been designed to solve different convex optimization problems or monotone variational inequality problems. Interested readers may consult the monograph by Facchinei and Pang [5].…”