Positive semidefinite matrix completion, universal rigidity and the strong Arnold property

DOI10.1016/j.laa.2014.03.015zbMath1291.90165arXiv1301.6616OpenAlexW2144002138MaRDI QIDQ2451678

Antonios Varvitsiotis, Monique Laurent

Publication date: 4 June 2014

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

Full work available at URL: https://arxiv.org/abs/1301.6616

zbMATH Keywords

semidefinite programmingmatrix completionnondegeneracyuniversal rigiditytensegrity frameworkStrong Arnold Property

Mathematics Subject Classification ID

Semidefinite programming (90C22) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

Related Items

Graph cores via universal completability, Global completability with applications to self-consistent quantum tomography, Matrices with high completely positive semidefinite rank, Partial identification in the statistical matching problem, Universal completability, least eigenvalue frameworks, and vector colorings, Half thresholding eigenvalue algorithm for semidefinite matrix completion, Global rigidity of triangulations with braces, Graph homomorphisms via vector colorings, Vector coloring the categorical product of graphs, Nullspace Embeddings for Outerplanar Graphs, On affine motions and universal rigidity of tensegrity frameworks, Symmetric matrices whose entries are linear functions, Universal rigidity of bar frameworks via the geometry of spectrahedra, Typical ranks in symmetric matrix completion, Singularity Degree of the Positive Semidefinite Matrix Completion Problem, Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope, Constrained Best Euclidean Distance Embedding on a Sphere: A Matrix Optimization Approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The real positive semidefinite completion problem for series-parallel graphs
• Two tree-width-like graph invariants
• On bar frameworks, stress matrices and semidefinite programming
• Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope
• Characterizing the universal rigidity of generic frameworks
• Positive definite completions of partial Hermitian matrices
• Global rigidity: The effect of coning
• Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming
• Rigidity and energy
• On the null space of a Colin de Verdière matrix
• The real positive definite completion problem for a simple cycle
• Complementarity and nondegeneracy in semidefinite programming
• Multiplicities of eigenvalues and tree-width of graphs
• Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
• Graphs with magnetic Schrödinger operators of low corank
• On dimensional rigidity of bar-and-joint frameworks
• Generic global rigidity
• Polynomial Instances of the Positive Semidefinite and Euclidean Distance Matrix Completion Problems
• Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
• The Gram Dimension of a Graph
• A Note on Extreme Correlation Matrices
• A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs
• Semidefinite Optimization and Convex Algebraic Geometry