On the convergence of the partial least squares path modeling algorithm |
| |
Authors: | Jörg Henseler |
| |
Institution: | 1. Institute for Management Research, Radboud University Nijmegen, PO Box 9108, 6500 HK, Nijmegen, The Netherlands
|
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|