Table 12 A.2. Function and Jacobian Evaluations (continued)
Related Figures (11)
Table 1. GAMSLIB Models Table 2. MCPLIB Models While we believe that any mature code should be connected with a modeling language, we also feel that there should be an easier means for making the library of test problems available to prototype algorithms. The MATLAB interface described in [14 provides such ameans. Using MATLAB, it is possible to quickly implement a prototype version of a new algorithm, which can be tested on the entire suite of test problems with the MATLAB interface. Thus, the test library can play an active role in influencing the d evelopment of new algorithms. It must be noted, however, that there are subtle differences between the MATLAB models and the GAMS models. In particular, many GAMS mode s vary not only the starting point for different runs, but also some of the underlying nonlinearities, whereas the MATLAB models vary only the starting point. Thus, a completely accurate comparison must be carried out exclusively inGAMS or exclusively in MATLAB. Table 3. Code Comparisons - Large Models Tables 3 and 4 summarize our results for two sets of models, the large ones (> 110 variables) for which only the sparsity-exploiting solvers were run, and the smaller ones on which all solvers were run. Table 4. Code Comparisons - Small Models Table 7. Summary for New Models It is our intention to add these models and newer models that are brought to our attention to MCPLIB. In this way we hope that the problem library will continue to serve as a guide for code developers so that they will direct their energies into areas that will best serve the users. otherwise we report an error using a letter to signify some sort of failure “F”, memory error “M”, time limit exceeded “T” or iteration limit exceeded “I”. Only the first error is listed per problem, while the numbers in parentheses are the number of problems that failed to solve. Table 5. New Models Table 6. Distinct Solutions Found Table A.1. Execution Times (continued) Table A.1. Execution Times (continued) Table A.2. Function and Jacobian Evaluations f(j) Table A.2. Function and Jacobian Evaluations (continued)
