The approach of SIAM J. Matrix Anal. Appl., 26(4):1083–1099 for solving structured total least squares prob-lems is generalized to weighted structured low-rank approximation with missing data. The method proposed is based on elimination of the correction matrix and solution of the resulting nonlinear least squares problem by local optimization methods. The elimination step is a singular linear least-norm problem, which admits an analytic solu-tion. Two approaches are proposed for the nonlinear least-squares minimization: minimization subject to equality constraints and unconstrained minimization with regularized cost function. The method is generalized to weighted low-rank approximation with singular weight matrix and is illustrated on matr...
The calculation of a low-rank approximation to a matrix is fundamental to many algorithms in compute...
The calculation of a low-rank approximation to a matrix is fundamental to many algorithms in compute...
. A nonlinear least squares problem is almost rank deficient at a local minimum if there is a large ...
The approach of SIAM J. Matrix Anal. Appl., 26(4):1083–1099 for solving structured total least squar...
Abstract. We consider low-rank approximation of affinely structured matrices with missing elements. ...
We consider low-rank approximation of affinely structured matrices with missing elements. The method...
Rank deficiency of a data matrix is equivalent to the existence of an exact linear model for the dat...
Rank deficiency of a data matrix is equivalent to the existence of an exact linear model for the dat...
We review the development and extensions of the classical total least squares method and describe al...
We review the development and extensions of the classical total least squares method and describe al...
In this paper, we consider the so-called structured low rank approximation (SLRA) problem as a probl...
Abstract. We consider the problem of approximating an affinely structured matrix, for example, a Han...
It is shown how structured and weighted total least squares and L 2 approximation problems lead to a...
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matri...
Matrix low-rank approximation is intimately related to data modelling; a problem that arises frequen...
The calculation of a low-rank approximation to a matrix is fundamental to many algorithms in compute...
The calculation of a low-rank approximation to a matrix is fundamental to many algorithms in compute...
. A nonlinear least squares problem is almost rank deficient at a local minimum if there is a large ...
The approach of SIAM J. Matrix Anal. Appl., 26(4):1083–1099 for solving structured total least squar...
Abstract. We consider low-rank approximation of affinely structured matrices with missing elements. ...
We consider low-rank approximation of affinely structured matrices with missing elements. The method...
Rank deficiency of a data matrix is equivalent to the existence of an exact linear model for the dat...
Rank deficiency of a data matrix is equivalent to the existence of an exact linear model for the dat...
We review the development and extensions of the classical total least squares method and describe al...
We review the development and extensions of the classical total least squares method and describe al...
In this paper, we consider the so-called structured low rank approximation (SLRA) problem as a probl...
Abstract. We consider the problem of approximating an affinely structured matrix, for example, a Han...
It is shown how structured and weighted total least squares and L 2 approximation problems lead to a...
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matri...
Matrix low-rank approximation is intimately related to data modelling; a problem that arises frequen...
The calculation of a low-rank approximation to a matrix is fundamental to many algorithms in compute...
The calculation of a low-rank approximation to a matrix is fundamental to many algorithms in compute...
. A nonlinear least squares problem is almost rank deficient at a local minimum if there is a large ...