A Double Nonmonotone Quasi-Newton Method for Nonlinear Complementarity Problem Based on Piecewise NCP Functions

Table 1

Iterations, CPU time, and for NCP Examples 2–6 between Algorithm1 and FDA.

Problem		Algorithm 1 with 3–1 piecewise			Algorithm 1 with 4–1 piecewise			Feasible directions algorithm
		Iter	CPU time		Iter	CPU time		Iter	CPU time
4.1		2	0.000814	5.49E – 09	13	0.001768	1.12E – 08	5	0.004301	6.58E – 07
		2	0.473808	5.69E – 08	13	1.520458	1.21E – 08	5	0.257754	−8.81E – 14
		3	15.640096	−1.58E – 11	13	18.551757	1.16E – 08	5	8.556959	7.20E – 14
		2	51.204458	4.51E – 10	13	70.145272	1.44E – 08	5	53.324527	−1.27E – 12
		3	0.000235	−1.02E – 07	8	0.000617	-5.41E – 08	10	0.000354	4.66E – 07
4.2		4	0.000288	5.25E – 08	10	0.000604	3.26E – 07	13	0.000529	3.76E – 07
		7	0.000462	−2.23E – 08	5	0.000742	4.64E – 07	19	0.001465	3.50E – 07
		15	0.001014	−2.23E – 08	22	0.001768	5.53E – 07	26	0.004301	6.58E – 07
4.3		15	0.001661	−4.62E – 09	24	0.002366	1.05E – 08	NaN	NaN	NaN
		16	0.001608	−2.14E – 09	20	0.001204	1.20E – 08	NaN	NaN	NaN
4.4		14	0.007181	−3.11E – 08	23	0.001696	-6.07E – 07	>500∗	Inf	NaN
		145	0.019268	1.80E – 08	86	0.004996	-2.26E – 07	21	0.007137	6.12E – 07
4.5		13	0.00103	−5.62E – 09	26	0.001658	4.93E – 09	36	0.001121	6.43E – 07
		23	0.002497	−5.65E – 07	30	0.003223	-2.75E – 08	65	0.009764	9.61E – 07
4.6		10	0.001351	1.52E – 08	9	0.001473	6.19E – 09	16	0.00746	3.67E – 07
4.7		11	0.039089	−9.29E – 11	17	0.001768	8.98E – 08	46	0.024301	8.81E – 07
		20	1.230144	2.26E – 10	20	1.745354	-2.68E – 11	52	1.157443	7.57E – 07
		15	25.532848	−2.61E – 12	20	35.615797	3.61E – 10	55	50.806954	8.14E – 07
		15	305.640096	−4.09E – 14	20	370.126146	4.62E – 09	57	415.720027	7.56E – 07
		4	0.002064	7.41E – 07	57	0.107685	1.32E – 07	NaN	NaN	NaN
4.8		6	0.641349	5.40E – 07	407	22.002366	3.10E – 06	NaN	NaN	NaN
		8	26.727794	1.87E – 06	>500^∗	Inf	NaN	NaN	NaN	NaN
		10	215.640096	5.19E – 06	>500^∗	Inf	NaN	NaN	NaN	NaN