Constrained (0,1)-matrix completion with a staircase of fixed zeros
From MaRDI portal
Publication:501232
Recommendations
- The \(N_{0}^{1}\)-matrix completion problem
- The \(P_0\)-matrix completion problem
- The \(P_0^+\)-matrix completion problem
- Matrix completion via max-norm constrained optimization
- Exact matrix completion via convex optimization
- The nonnegative P_0-matrix completion problem
- The \(Q_0\)-matrix completion problem
- Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation
- On a Class of Matrix Completion Problems
- Guaranteed Matrix Completion via Non-Convex Factorization
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- A theorem on flows in networks
- Bidimensional allocation of seats via zero-one matrices with given line sums
- Combinatorial Properties of Matrices of Zeros and Ones
- Combinatorial matrix classes
- Combinatorial optimization. Theory and algorithms.
- Combinatorial theorems and integral matrices
- Constructing \((0,1)\)-matrices with given line sums and certain fixed zeros
- Discrete tomography. Foundations, algorithms, and applications
- Duration-Differentiated Energy Services With a Continuum of Loads
- Hard real-time computing systems. Predictable scheduling algorithms and applications.
- Inequalities: theory of majorization and its applications
- Integral matrices with given row and column sums
- Matrices of zeros and ones with fixed row and column sum vectors
- Matrices of zeros and ones with given line sums and a zero block
- Properties of a Class of (0,1)-Matrices Covering a given Matrix
- Simple existence conditions for zero-one matrices with at most one structural zero in each row and column
- Traces of Matrices of Zeros and Ones
- Zero-one matrices with zero trace
Cited in
(4)
This page was built for publication: Constrained \((0,1)\)-matrix completion with a staircase of fixed zeros
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q501232)