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

Table 4

Iterations, CPU time, and for problem 4.9–4.13.

Problem	x0	Algorithm 1 with 3–1 piecewise			Algorithm 1 with 4–1 piecewise
		Iter	CPU time	XTF(X)	Iter	CPU time	XTF(X)
4.9		20	0.005197	−1.87E − 06	23	0.00523	−1.49E − 06
		18	0.010009	−2.28E − 06	21	0.019381	−3.98E − 06
4.10		45	0.033759	3.61E − 06	43	0.050365	1.03E − 06
		55	0.05047	7.62E − 07	49	0.055852	−1.80E − 06
4.11		13	0.052309	1.87E − 08	15	0.089898	1.65E − 08
		14	2.080973	−3.66E − 09	16	2.616348	1.94E − 09
		14	60.367315	1.05E − 09	16	68.659795	8.54E − 09
		14	574.245627	3.05E − 09	20	682.960276	−5.23E − 09
		14	0.058579	1.96E − 09	14	0.072436	−5.59E − 09
4.12		14	2.376266	−1.89E − 08	14	2.348159	−4.86E − 09
		12	53.195688	−7.32E − 09	14	61.321038	2.96E − 12
		17	519.846528	−2.89E − 08	14	582.933657	3.25E − 11
		17	0.060449	1.99E − 08	19	0.0813907	4.00E − 09
		17	2.860266	5.62E − 08	19	3.145843	8.61E − 09
4.13		17	74.532155	7.27E − 08	19	82.960276	−2.45E − 09
		21	674.226819	2.02E − 08	23	782.155632	5.12E − 09