On complexity of a new Mehrotra-type interior point algorithm for $P_{*}(\kappa )$ linear complementarity problems

Journal of Inequalities and Applications

Table 2 The iteration numbers of Problem 2

n	Algorithm 1	MTY	Cho’s	IPMCKF
10	10	31	31	34
20	11	37	44	39
30	12	40	49	43
40	13	40	52	44
50	13	49	53	47
100	15	58	64	52
150	15	73	68	55
200	16	85	71	57

n	Algorithm 1	MTY	Cho’s	IPMCKF
10	10	31	31	34
20	11	37	44	39
30	12	40	49	43
40	13	40	52	44
50	13	49	53	47
100	15	58	64	52
150	15	73	68	55
200	16	85	71	57

n	Algorithm 1	MTY	Cho’s	IPMCKF
10	10	31	31	34
20	11	37	44	39
30	12	40	49	43
40	13	40	52	44
50	13	49	53	47
100	15	58	64	52
150	15	73	68	55
200	16	85	71	57

n	Algorithm 1	MTY	Cho’s	IPMCKF
10	10	31	31	34
20	11	37	44	39
30	12	40	49	43
40	13	40	52	44
50	13	49	53	47
100	15	58	64	52
150	15	73	68	55
200	16	85	71	57