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…

A class of oblique rotation procedures is proposed to rotate a pattern matrix so that it optimally resembles a matrix that has an exact simple pattern. It is demonstrated that the method can recover relatively complex simple structures where other simple structure rotation techniques fail. (SLD)

Most of the current analytic rotation criteria for simple structure in factor analysis are summarized and identified as members of a general symmetric family of quartic criteria. A unified development of algorithms for orthogonal and direct oblique rotation using arbitrary criteria from this family is presented. (Author/TJH)

A procedure is outlined showing how the axiom of local independence for latent structure models can be weakened. (CK)

Relations between maximum likelihood factor analysis and factor indeterminacy are discussed. (CK)

Applications to the Promax Rotation are discussed, and it is shown that these procedures solve Thurstone's hitherto intractable "invariant" box problem as well as other more common problems based on real data. (Author/RC)