Constrained (0,1)-matrix completion with a staircase of fixed zeros

DOI10.1016/J.LAA.2016.08.020zbMATH Open1352.05178OpenAlexW2510500928MaRDI QIDQ501232FDOQ501232

Li Qiu, Wei Chen, Pravin Varaiya, Yanfang Mo

Publication date: 29 December 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2016.08.020

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

zbMATH Keywords

Young diagramconstrained \((0,1)\)-matrix completionfixed zerosstructure tensor

Mathematics Subject Classification ID

Applications of graph theory (05C90) Matrix completion problems (15A83)

Cites Work

• Inequalities: theory of majorization and its applications
• Combinatorial matrix classes
• Title not available (Why is that?)
• Discrete tomography. Foundations, algorithms, and applications
• A theorem on flows in networks
• Matrices of zeros and ones with fixed row and column sum vectors
• Combinatorial Properties of Matrices of Zeros and Ones
• Hard Real-Time Computing Systems
• Combinatorial optimization. Theory and algorithms.
• Zero-one matrices with zero trace
• Constructing \((0,1)\)-matrices with given line sums and certain fixed zeros
• Combinatorial theorems and integral matrices
• Integral matrices with given row and column sums
• Properties of a Class of (0,1)-Matrices Covering a given Matrix
• Duration-Differentiated Energy Services With a Continuum of Loads
• Traces of Matrices of Zeros and Ones
• Matrices of zeros and ones with given line sums and a zero block
• Bidimensional allocation of seats via zero-one matrices with given line sums
• Simple existence conditions for zero-one matrices with at most one structural zero in each row and column

Cited In (2)

• Market implementation of multiple-arrival multiple-deadline differentiated energy services
• Approximate graph colouring and the hollow shadow

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)