We have presented a comparison of different open-source geometry optimization codes available to the community. The performance of the geometry optimization algorithms implemented in these codes has been evaluated for a test set of 30 molecules that was originally proposed by Baker. We find results in line with expectations for the various optimization algorithms. While there are differences for individual molecules, when Cartesian coordinates are used, the optimization algorithms take at least 20 and in the worst case 24 steps on average per molecule of this test set. For internal coordinate optimization algorithms, the number of steps is greatly reduced requiring about 12 steps per molecule when using a unit matrix as 6 Data and Software Availability