Abstrakt
The total least squares (TLS) framework represents a popular data fitting approach for solving matrix approximation problems of the form A(X) a AX approximate to B. A general linear mapping on spaces of matrices A : X -> B can be represented by a fourth-order tensor which is in the AX approximate to B case highly structured.
This has a direct impact on solvability of the corresponding TLS problem, which is known to be complicated. Thus this paper focuses on several generalizations of the model A: the bilinear model, the model of higher Kronecker rank, and the fully tensorized model.
It is shown how the corresponding generalization of the TLS formulation induces enrichment of the search space for the data corrections. Solvability of the resulting minimization problem is studied.
Furthermore, extension of the so-called core reduction to the bilinear model is presented. For the fully tensor model, its relation to a particular single right-hand side TLS problem is derived.
Relationships among individual formulations are discussed. (C) 2019 Elsevier Inc. All rights reserved.