An Alternating Direction Method for Convex Quadratic Second-Order Cone Programming with Bounded Constraints

Table 2

The results for the test problems with small scale.

Problems	MADM			SeDuMi
	Iter.	Time	Value	Iter.	Time	Value
P01	216	0.14	6.8296723	9	0.34	6.8296742
P02	245	0.25	71.9788074	9	0.31	71.9788099
P03	264	0.30	76.2533942	11	0.39	76.2533927
P04	261	0.34	143.5300081	11	0.44	143.5300023
P05	269	0.33	47.1664568	10	0.81	47.1664516
P06	271	0.56	164.0914031	12	1.16	164.0914052
P07	293	0.66	467.8962158	13	1.28	467.8962123
P08	320	0.89	671.0620751	13	1.34	671.0620812
P09	322	1.53	71.2857981	12	5.19	71.2857926
P10	337	2.28	85.4731057	13	7.41	85.4731061
P11	304	2.14	1085.3976583	15	7.94	1085.3976475
P12	316	2.62	2256.4765633	16	10.11	2256.4765646
P13	351	4.17	89.3228874	11	15.03	89.3228832
P14	377	5.14	113.5586948	12	16.16	113.5586923
P15	327	5.13	2198.2136742	16	27.53	2198.2136739
P16	326	5.81	2727.7797204	16	32.67	2727.7797233