A prediction-correction inexact alternating direction method for convex nonlinear second-order cone programming with linear constraints

Journal of Inequalities and Applications

Table 1 The compared results for the test problems with medium scale

Problems	m	n	SOC	\(\alpha _{1}\)	PCIADM		SQP
Problems	m	n	SOC	\(\alpha _{1}\)	Iter.	Time	Iter.	Time
P01	10	20	2 × 5	\(0.1\alpha _{0}\)	37	0.046	6	0.360
P02	30	60	2 × 5; 1 × 20	\(0.01\alpha _{0}\)	50	0.109	7	0.620
P03	50	100	2 × 5; 2 × 20	\(0.01\alpha _{0}\)	74	0.187	7	1.461
P04	70	140	2 × 5; 3 × 20	\(0.01\alpha _{0}\)	69	0.265	8	1.962
P05	90	180	2 × 5; 4 × 20	\(0.01\alpha _{0}\)	26	0.171	8	2.652
P06	110	220	2 × 5; 5 × 20	\(0.01\alpha _{0}\)	30	0.343	9	2.924
P07	130	260	2 × 5; 6 × 20	\(0.01\alpha _{0}\)	87	1.041	9	5.401
P08	150	300	2 × 5; 7 × 20	\(0.01\alpha _{0}\)	24	0.393	10	7.676
P09	170	340	2 × 5; 8 × 20	\(0.01\alpha _{0}\)	25	0.642	11	10.95
P10	190	380	2 × 5; 9 × 20	\(0.01\alpha _{0}\)	34	1.096	11	14.72
P11	210	420	2 × 5; 10 × 20	\(0.01\alpha _{0}\)	53	2.187	12	20.21
P12	230	460	2 × 5; 11 × 20	\(0.01\alpha _{0}\)	33	1.781	13	25.43
P13	250	500	2 × 5; 12 × 20	\(0.01\alpha _{0}\)	34	2.422	14	32.15
P14	270	540	2 × 5; 13 × 20	\(0.01\alpha _{0}\)	51	5.484	14	40.62
P15	290	580	2 × 5; 14 × 20	\(0.01\alpha _{0}\)	104	11.67	15	53.03