The results will be made publicly available here. If, as an authors of such software, you are interested in our evaluation of your code, the notes on Global Optimization Software Evaluation will tell you what you need to know. In a few cases, I added information on problems where a code has difficulties. Lack of critical information doesn't mean that a code has no problems, but only that nobody informed me about any weaknesses. In general, performance must be expected to deteriorate with increasing dimension.
Many codes allow no constraints or only bound constraints.
Since I was asked repeatedly what to try first, here are some suggestions for continuous problems. But they are backed up by little else than my feelings of what I'd try first, and I am using a small font size to emphasize that this is information of a poorer quality than in the rest of my pages. Please write me if you have significant experience that leads to improved suggestions, or that confirm the ones given. So you might want to use a penalty or barrier formulation of a constrained problem to be able to apply one of these algorithms. Fast specialized solvers for many linearly constrained problems.