Approximating the minimum rank of a graph via alternating projection
From MaRDI portal
Publication:1785758
DOI10.1016/j.orl.2016.02.001zbMath1408.65023MaRDI QIDQ1785758
Publication date: 1 October 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2016.02.001
90C35: Programming involving graphs or networks
90C59: Approximation methods and heuristics in mathematical programming
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
65F99: Numerical linear algebra
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- On the graph complement conjecture for minimum rank
- Minimum rank, maximum nullity and zero forcing number for selected graph families
- Expected values of parameters associated with the minimum rank of a graph
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
- Computation of minimal rank and path cover number for certain graphs
- Zero forcing sets and the minimum rank of graphs
- Power domination in graphs
- On rings of operators. Reduction theory
- Zero Forcing Sets and Controllability of Dynamical Systems Defined on Graphs
- A Singular Value Thresholding Algorithm for Matrix Completion
- Nondiscriminatory propagation on trees
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- A new approach to layered space-time coding and signal processing
- Space-time block codes from orthogonal designs
- Domination in Graphs Applied to Electric Power Networks
- Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks
- Alternating Projections on Manifolds
