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

Table 5

The results in smaller criteria and with random initial points.

Problems	MADM			SeDuMi
	Iter.	Time	Value	Iter.	Time	Value
P04 (, random point)	275	0.37	169.24049123	21	0.88	169.24049003
P04 (, fixed point)	287	0.41	169.24049234	21	0.88	169.24049003
P04 (, random point)	485	0.62	169.24049007	21	0.88	169.24049003
P04 (, fixed point)	494	0.67	169.24049007	21	0.88	169.24049003
P12 (, random point)	355	2.55	1904.587401	27	20.52	1904.587416
P12 (, fixed point)	367	2.95	1904.587402	27	20.52	1904.587416
P12 (, random point)	628	4.37	1904.587409	27	20.52	1904.587416
P12 (, fixed point)	642	5.20	1904.587408	27	20.52	1904.587416