Journal
COMPUTATIONAL STATISTICS
Volume 25, Issue 1, Pages 107-120Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s00180-009-0164-x
Keywords
Partial least squares path modeling; PLS; Convergence
Categories
Ask authors/readers for more resources
This paper adds to an important aspect of Partial Least Squares (PLS) path modeling, namely the convergence of the iterative PLS path modeling algorithm. Whilst conventional wisdom says that PLS always converges in practice, there is no formal proof for path models with more than two blocks of manifest variables. This paper presents six cases of non-convergence of the PLS path modeling algorithm. These cases were estimated using Mode A combined with the factorial scheme or the path weighting scheme, which are two popular options of the algorithm. As a conclusion, efforts to come to a proof of convergence under these schemes can be abandoned, and users of PLS should triangulate their estimation results.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available