. Author manuscript; available in PMC: 2013 Nov 12.

Published in final edited form as: IEEE Trans Pattern Anal Mach Intell. 2011 Mar 10;33(10):2051–2065. doi: 10.1109/TPAMI.2011.50

TABLE 1.

Algorithm performances on random matrices with missing data: frequency of sub-optimal solutions (%) and average number of iterations (in parenthesis).

ρ(%), σ_n	PF	LM-S	LM-S_GN	CSF
25, .1	23 (313)	1 (16)	4 (82)	3 (57)
25, .2	30 (391)	3 (17)	6 (93)	3 (65)
25, .4	28 (381)	3 (16)	8 (108)	5 (74)
50, .1	71 (813)	12 (51)	14 (96)	11 (79)
50, .2	76 (831)	15 (58)	14 (105)	12 (89)
50, .4	77 (869)	18 (61)	19 (120)	16 (103)
75, .1	100 (1000)	69 (356)	62 (380)	42 (549)
75, .2	100 (1000)	72 (376)	54 (419)	46 (586)
75, .4	100 (1000)	77 (421)	65 (473)	44 (698)