Table 1.

Complexity comparison of available algorithms.

	SDPH [35]	SDP [36]	EDM [37]	ADMM_P
Convex problem size	$dN+1/2N(N+1)$	$dN+1/2N(N+1)+N^2$	$N+M(M-1)/2+N_c$	$d({\widehat{\mathcal{N}}}_i+1)$
Computational complexity	$O(N^3)$	$O({(2N)}^3)$	$O(N^3+N^2)$	$O(d^3+{(d{\widehat{\mathcal{N}}}_i)}^2)$
Type of framework	Centralized SDP	Centralized SDP	Three-block ADMM	Parallel ADMM
Communication cost	N	N	N	$d({\widehat{\mathcal{N}}}_i+1)$