A Nonmonotone Weighting Self-Adaptive Trust Region Algorithm for Unconstrained Nonconvex Optimization

Table 4

Numerical comparisons for some large-scale test problems.

PDim	BTR	NTR1	NTR2	NTRW
	iter/nf/cpu	iter/nf/cpu	iter/nf/cpu	iter/nf/cpu
	—	—	—
	—	—	—
	—	—	—
	—	—
	—	—
		—
	—	—
	—	—	—
		—	—
		—	—

— means that the algorithm does not end in 30 minutes; means that the algorithm reaches 5000 iterations.