On a general class of matrix nearness problems
The following problem is considered: Given a rectangular matrix A, determine a matrix \(\Delta\) of minimal norm and prescribed sparsity such that \(\text{rank}(A+\Delta)<\text{rank } A\). Describing the sparsity pattern by means of a generalized block decomposition into zero and possibly nonzero blocks one considers norms which are of the form \(\|\Delta\|=(f(\nu))^{1/\alpha}\), where \(f\) is a monotone gauge function and \(\nu=(\nu_ i)\) denotes the nonnegative vector whose components are the norms of the individual nonzero blocks in \(\Delta\). The norm for each block may be different, but is assumed to be separable (i.e., \(\nu_ i=\| uv^ T\|_{(i)}=\| u\|_{A_ i}\| v^ T\|^*_{B_ i}\), \(\|\cdot\|_{A_ i}\) a vector norm, \(\| \cdot\|^*_{B_ i}\) a dual vector norm for each rank one block \(uv^ T\)). It is shown that, provided the problem is solvable (i.e., the set of all \(\Delta\) such that \(\text{rank}(A+\Delta)<\text{rank }A\) is nonempty), it can be solved by considering a related (reduced) problem, involving less variables and only the vector norms \(\|\cdot\|_{A_ i}\) and \(\|\cdot\|_{B_ i}\). The description is then spezialized to matrix norms which separate into vector-\(\ell_ 2\)-norms, such as the spectral- (i.e. the \(\ell_ 2\)-operator) or the Frobenius norm. In that case it is possible to formulate stationary point conditions for the reduced problem. The procedure is illustrated by some numerical examples. The paper closes with a short section on the problem of finding a \(\Delta\) of minimal norm such that \(\text{rank}(A+\Delta)=\text{rank }A-d\), where \(d>0\) is prescribed.
- A generalization of the Eckart-Young-Mirsky matrix approximation theorem
- An Analysis of the Total Approximation Problem in Separable Norms, and an Algorithm for the Total l₁ Problem
- An Analysis of the Total Least Squares Problem
- Analysis of the Effects of Irregular Terrain on Radio Wave Propagation Based on a Three-Dimensional Parabolic Equation
- Characterization and efficient computation of the structured singular value
- scientific article; zbMATH DE number 3737398 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- m-form numerical range and the computation of the structured singular value
- On a class of algorithms for total approximation
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- The Smallest Perturbation of a Submatrix that Lowers the Rank of the Matrix
- The Smallest Perturbation of a Submatrix which Lowers the Rank and Constrained Total Least Squares Problems
- A matrix minimization problem involving ranks
- Geometric multiplicity margin for a submatrix
- A matrix nearness problem related to iterative methods
- Some matrix nearness problems suggested by Tikhonov regularization
- scientific article; zbMATH DE number 3876476 (Why is no real title available?)
- Decomposition methods for sparse matrix nearness problems
- scientific article; zbMATH DE number 89042 (Why is no real title available?)
- Properties of the Approximations of a Matrix which Lower its Rank
- Singular value decomposition and the nearest matrix of a lower rank
- Rank Reducing Matrix Norms
- scientific article; zbMATH DE number 4115838 (Why is no real title available?)
- scientific article; zbMATH DE number 5054719 (Why is no real title available?)
- A theoretical algorithm for the closest matrices in the space of Doubly Stochastic Matrices
- Generalized Matrix Nearness Problems
This page was built for publication: On a general class of matrix nearness problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1176190)
