Feasible Descent Algorithms For Mixed Complementarity Problems: Complete Numerical Results

This report gives the complete numerical results obtained with the PATH-FB solver described in the accompanying paper [3]. For each problem, we provide the following information: Problem: Name of the test example in GAMSLIB/MCPLIB SP: Number of starting point MI: Number of major iterations CI: Number of iterations used in the crash technique R: Number of restarts PG: Number of projected gradient steps T: Time in seconds for PATH-FB (PATH 3.0). Note that the last column of our tables does not only give the times for the new PATH-FB solver, but also (for the sake of comparison) those for the PATH 3.0 solver [4]. Section 2 gives the detailed results for the test problems from the GAMSLIB collection [1], whereas Section 3 contains the results for the test examples from the MCPLIB collection [2]. 2 GAMSLIB Problem