Maximum rank matrix completion
From MaRDI portal
Publication:1300879
DOI10.1016/S0024-3795(98)10210-0zbMath0933.15026MaRDI QIDQ1300879
Publication date: 11 November 1999
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Inverse problems in linear algebra (15A29) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items (18)
A simultaneous decomposition of a matrix triplet with applications ⋮ Dynamic matrix rank ⋮ Some optimization problems on ranks and inertias of matrix-valued functions subject to linear matrix equation restrictions ⋮ Non-commutative Edmonds' problem and matrix semi-invariants ⋮ Formulas for calculating the extremum ranks and inertias of a four-term quadratic matrix-valued function and their applications ⋮ On completions of symmetric and antisymmetric block diagonal partial matrices ⋮ Input matrix construction and approximation using a graphic approach ⋮ Subspace Arrangements, Graph Rigidity and Derandomization Through Submodular Optimization ⋮ Extremal ranks of some nonlinear matrix expressions with applications ⋮ Dynamic matrix rank with partial lookahead ⋮ Max-min problems on the ranks and inertias of the matrix expressions \(A - BXC \pm (BXC)^{\ast}\) with applications ⋮ Semidefinite programming for discrete optimization and matrix completion problems ⋮ The inverse of any two-by-two nonsingular partitioned matrix and three matrix inverse completion problems ⋮ On the complexity of matrix rank and rigidity ⋮ Linear matroid intersection is in quasi-NC ⋮ Relations between least-squares and least-rank solutions of the matrix equation \(AXB=C\) ⋮ The computational complexity of some problems of linear algebra ⋮ Generalized Wong sequences and their applications to Edmonds' problems
Cites Work
This page was built for publication: Maximum rank matrix completion
