Key points are not available for this paper at this time.
A mathematical framework is presented for constructing degenerate CANDECOMP/PARAFAC models. It is possible to construct degenerate arrays which can be approximated by two-factor models to arbitrary precision but which do not possess an exact two-factor representation. Equivalence of different degenerate presentations is demonstrated. By using this model, tasks are constructed where the straight path from the specified starting point to the best-fit solution will pass through a degenerate area. Swamp behavior is observed when such tasks are solved by various algorithms. Copyright © 2000 John Wiley & Sons, Ltd.
Pentti Paatero (2000) studied this question.