Search

The present paper deals with convergence issues of Lohmöller’s procedure for the computation of the components in the PLS-PM algorithm. More datasets and proofs are given to highlight the convergence failure of this procedure. Consequently, a new procedure based on the Signless Lapalacien matrix of the indirect graph between constructs is introduced. In several cases that will be specified in this paper, both monotony and error convergence for this new procedure will be established. Several comparisons will be presented between the new procedure and the two conventionally used procedures (Lohmöller’s and Hanafi-Wold’s procedures).

Partial least squares path modeling is a statistical method that allows to analyze complex dependence relationships among several blocks of observed variables, each one represented by a latent variable. The computation of latent variable scores is an essential step of the method, achieved through an iterative procedure named here Hanafi–Wold’s procedure. The present paper generalizes properties already known in the literature for this procedure, from which additional convergence results will be obtained.