In the above paper,1 the authors present two sets of convergent least squares algorithms for identification in H(infinity). In this note we : 1) point out an error in the proof of convergence for the first set, 2) show that the first set of optimization problems is really equivalent to a special case of the second set, and 3) provide a small correction to the derivation of the error bounds for the second set of algorithms.