Computational aspects of the greatest lower bound to the reliability and constrained minimum trace factor analysis

In the last decade several algorithms for computing the greatest lower bound to reliability or the constrained minimum-trace communality solution in factor analysis have been developed. In this paper convergence properties of these methods are examined. Instead of using Lagrange multipliers a new theorem is applied that gives a sufficient condition for a symmetric matrix to be Gramian. Whereas computational pitfalls for two methods suggested by Woodhouse and Jackson can be constructed it is shown that a slightly modified version of one method suggested by Bentler and Woodward can safely be applied to any set of data. A uniqueness proof for the solution desired is offered.The authors are obliged to Charles Lewis and Dirk Knol for helpful comments, and to Frank Brokken and Henk Camstra for developing computer programs.