Identifies a general algorithm for orthogonal rotation and shows that when an algorithm parameter alpha is sufficiently large, the algorithm converges monotonically to a stationary point of the rotation criterion from any starting value. Introduces a modification that does not require a large alpha and discusses the use of this modification as a…

An iterative majorization algorithm is proposed for orthogonal congruence rotation that is guaranteed to converge from every starting point. In addition, the algorithm is easier to program than the algorithm proposed by F. B. Brokken, which is not guaranteed to converge. The derivation of the algorithm is traced in detail. (SLD)

An iterative process is proposed for obtaining an orthogonal simple structure solution. At each iteration, a target matrix is constructed such that the relative contributions of the target majorize the original ones, factor by factor. The convergence of the procedure is proven, and the algorithm is illustrated. (SLD)