Singularity Degree of the Positive Semidefinite Matrix Completion Problem

DOI10.1137/16M1069262zbMath1365.90192arXiv1603.09586OpenAlexW2964300938MaRDI QIDQ5737737

Shin-ichi Tanigawa

Publication date: 30 May 2017

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

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

zbMATH Keywords

graph rigidityuniversal rigidityfacial reductionsingularity degreepositive semidefinite matrix completion problemuniquely solvable SDP

Mathematics Subject Classification ID

Semidefinite programming (90C22) Optimality conditions and duality in mathematical programming (90C46) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

Related Items (4)

Characterizing the universal rigidity of generic tensegrities ⋮ Characterization of the dual problem of linear matrix inequality for H-infinity output feedback control problem via facial reduction ⋮ Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs ⋮ Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Farkas lemma and dimensional rigidity of bar frameworks
• Universal rigidity of complete bipartite graphs
• The real positive semidefinite completion problem for series-parallel graphs
• Combining globally rigid frameworks
• Characterizing the universal rigidity of generic frameworks
• Structural conditions for cycle completable graphs
• Rigidity and energy
• Complementarity and nondegeneracy in semidefinite programming
• Decomposition of odd-hole-free graphs by double star cutsets and 2-joins
• Iterative universal rigidity
• Positive semidefinite matrix completion, universal rigidity and the strong Arnold property
• Universal Rigidity and Edge Sparsification for Sensor Network Localization
• Error Bounds for Linear Matrix Inequalities
• Prestress Stability of Triangulated Convex Polytopes and Universal Second-Order Rigidity
• The real positive definite completion problem: cycle completability
• Coordinate Shadows of Semidefinite and Euclidean Distance Matrices
• Exact Duality in Semidefinite Programming Based on Elementary Reformulations

This page was built for publication: Singularity Degree of the Positive Semidefinite Matrix Completion Problem