Iterative Process of Msplit(q) Estimation

Msplit(q) estimation allows us to estimate competitive parameters, namely different versions of the parameter vector within the split functional model. In the univariate model, such parameters can be regarded as location parameters for different observation aggregations. The whole observation set might be an unrecognized mixture of observations that belong to such aggregations. There are two main variants of Msplit(q) estimation: the squared and absolute Msplit(q) estimations, which differ from each other in objective functions. The estimation process is always an iterative one, irrespective of the estimation variant. This paper addresses the main practical problem in such a context, namely the choice of the starting point and its possible influence on the estimation results. The paper shows that this issue is important; it also proposes the best choice that guarantees the correct solutions of the optimization problem. The authors also consider two types of iterative processes and conclude that the traditional iterative process is recommended for squared Msplit(q) estimation, whereas the parallel process is suitable for absolute Msplit(q) estimation.