On the automatic restricted-step rational-function-optimization method

The rational function optimization algorithm is one of the widely used meth ods to search stationary points on surfaces. However, one of the drawbacks of this method is the step reduction procedure to deal with the oversteppin g problem. We present and comment on a method such that the step obtained f rom the solution of the rational function equations possesses the desired c orrect length. The analysis and discussion of the method is mainly centered on the location and optimization of transition states.