Algorithm 2 “SOCP2”: the proposed distributed SOCP algorithm for unknown PT.
Require: X^ (0) , K1max, K 2max, , xa, ∀a ∈
1:	Initialize: k ← 1
2:	repeat
3:	for c = 1, …, do
4:	for all i ∈ c (in parallel) do
5:	Collect x^j from j ∈ i
6:	${\widehat{x}}_{i\text{socp}}^{\left(k\right)}$ ← solve (10)
7:	${\widehat{x}}_i^{\left(k\right)}\leftarrow \left(1-w\right){\widehat{x}}_i^{\left(k-1\right)}+w{\widehat{x}}_{i\text{socp}}^{\left(k\right)}$
8:	Broadcast ${\widehat{x}}_i^{\left(k\right)}$ to j ∈ i
9:	end for
10:	end for
11:	k ← k + 1
12:	until k ≤ K1max
13:	for c = 1, …, do
14:	for all i ∈ c (in parallel) do
15:	$${\widehat{L}}_{0i}\leftarrow \frac{{\sum }_{j\in N_i}{L}_{ij}-10\gamma {log}_{10}\frac{\Vert {\widehat{x}}_i^{\left(k\right)}-{\widehat{x}}_j^{\left(k\right)}\Vert }{d_0}}{\left|N_i\right|}$$
16:	end for
17:	end for
18:	begin consensus
19:	$${\widehat{L}}_0\leftarrow \frac{1}{M}{\sum }_{i=1}^M{\widehat{L}}_{0i}$$
20:	end consensus
21:	k ← K1max + 1
22:	repeat
23:	for c = 1, …, do
24:	for all i ∈ c (in parallel) do
25:	Collect x^j from j ∈ i
26:	$${\widehat{x}}_i^{\left(k\right)}$$ ← solve (9) by using L^0
27:	Broadcast $${\widehat{x}}_i^{\left(k\right)}$$ to j ∈ i
28:	end for
29:	end for
30:	k ← k + 1
31:	until k ≤ K1max + K2max