Benchmarks

Here we provide information on testruns comparing different solution methods on standardized sets of testproblems, running on the same or on different computer systems. Benchmarking is a difficult area for nonlinear problems, since different codes use different criteria for termination. Although much effort has been invested in making results comparable, in a critical situation you should try the candidates of your choice on your specific application. Many benchmark results can be found in the literature, below we list our own benchmarks as well as a selection of those done by others:

	BENCH	Hans Mittelmann's benchmarks
	Performance World	New Initiative by GAMS World

General papers related to benchmarking:

	Performance Profiles	suggestions for performance metric and associated Perl scripts
	Experimental Analysis of Algorithms	recommendations on this closely related topic

Benchmarks performed by others:

	MCNF Benchmark	Simplex and cost-scaling codes for large minimum cost flow problems
	Simplex benchmark	A Comparison of Simplex Method Algorithms (with Matlab scripts)
	KNITRO	KNITRO, SNOPT, LOQO, and filterSQP with the CUTE(AMPL) problems.
	LOQO	KNITRO, SNOPT, and LOQO, with the CUTE(AMPL) problems.
	A. Waechter's diss.	IPOPT, KNITRO, and LOQO on various testsets
	Bound-constraints I	Comparison of PL2 and L-BFGS-B.
	Bound-constraints II