Algorithm 1 IDC-based SDP algorithm.

Initialization: Set the initial values for ${\mathbf{s}}^{\left(0\right)}$ by letting $\{{\mathbf{W}}_k^{\left(0\right)},{\mathbf{V}}^{\left(0\right)}\}$ be a feasible point to problem ${\mathbf{P}}_4$;  Repeat:  Step 1: Fix $\left\{{\nu }_l\right\}$, solve problem ${\mathbf{P}}_4$ and return instantaneous optimal solution $\{{\mathbf{W}}_k^{★},{\mathbf{V}}^{★},{\mathbf{s}}^{★}\}$;  Step 2: Update $\{{\mathbf{W}}_k\leftarrow {\mathbf{W}}_k^{★},\mathbf{V}\leftarrow {\mathbf{V}}^{★},\mathbf{s}\leftarrow {\mathbf{s}}^{★},\tau \leftarrow \varsigma \tau \}$, update $\left\{{\nu }_l\right\}$ using ${\mathbf{s}}^{\left(0\right)}={[s_1^{★},\cdots ,s_L^{★}]}^T$.  Until convergence or maximum iteration is reached.