In the following experiment, we show the performance of our method compared with CSA [1]}, PSG [2]} and YNW [3]} . For all four methods, we use an efficient mini-batch strategy, that is, at each iteration the stochastic gradients of the objective function and the constraint function are computed, respectively, by
\(v_0^k:=\frac{1}{|\mathcal {N}_0^k|}\sum _{i\in \mathcal {N}_0^k}\nabla f_i(x^k),\quad v_1^k:=\frac{1}{|\mathcal {N}_1^k|}\sum _{i\in \mathcal {N}_1^k}\nabla g_i(x^k),\) 
