Abstrakt
Linear matrix approximation problems AX approximate to B are often solved by the total least squares minimization (TLS). Unfortunately, the TLS solution may not exist in general.
The so-called core problem theory brought an insight into this effect. Moreover, it simplified the solvability analysis if B is of column rank one by extracting a core problem having always a unique TLS solution.
However, if the rank of B is larger, the core problem may stay unsolvable in the TLS sense, as shown for the first time by Hnetynkova, Pleinger, and Sima (2016). Full classification of core problems with respect to their solvability is still missing.
Here we fill this gap. Then we concentrate on the so-called composed (or reducible) core problems that can be represented by a composition of several smaller core problems.
We analyze how the solvability class of the components influences the solvability class of the composed problem. We also show on an example that the TLS solvability class of a core problem may be in some sense improved by its composition with a suitably chosen component.
The existence of irreducible problems in various solvability classes is discussed.