# Is Parks-Mcclellan algorithm guaranteed to stop?

Is there any guarantee that Parks-Mcclellan eventually stop? If so, is there any formula that shows number of maximum interations that ensure that the algorithm stops?