On bar frameworks, stress matrices and semidefinite programming

DOI10.1007/s10107-010-0389-zzbMath1225.90095OpenAlexW2068640222MaRDI QIDQ717126

Abdo Y. Alfakih

Publication date: 27 September 2011

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-010-0389-z

zbMATH Keywords

semidefinite programmingGale transformuniversal rigiditybar frameworksstress matrices

Mathematics Subject Classification ID

Semidefinite programming (90C22) Hermitian, skew-Hermitian, and related matrices (15B57) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

On Flattenability of Graphs ⋮ On stress matrices of \((d + 1)\)-lateration frameworks in general position ⋮ Characterizing the universal rigidity of generic tensegrities ⋮ On affine motions and universal rigidity of tensegrity frameworks ⋮ Fully distributed affine formation control of general linear systems with uncertainty ⋮ Positive semidefinite matrix completion, universal rigidity and the strong Arnold property ⋮ Universal rigidity of complete bipartite graphs ⋮ Universal rigidity of bar frameworks via the geometry of spectrahedra ⋮ Characterizing the universal rigidity of generic frameworks ⋮ Selected Open Problems in Discrete Geometry and Optimization ⋮ Local, Dimensional and Universal Rigidities: A Unified Gram Matrix Approach ⋮ Iterative universal rigidity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sensor network localization, Euclidean distance matrix completions, and graph realization
• (Robust) edge-based semidefinite programming relaxation of sensor network localization
• Characterizing the universal rigidity of generic frameworks
• Theory of semidefinite programming for sensor network localization
• Solving Euclidean distance matrix completion problems via semidefinite progrmming
• Complementarity and nondegeneracy in semidefinite programming
• On the uniqueness of Euclidean distance matrix completions: the case of points in general position
• Graph rigidity via Euclidean distance matrices
• On dimensional rigidity of bar-and-joint frameworks
• Generic global rigidity
• A semidefinite programming approach to tensegrity theory and realizability of graphs
• Characterizing generic global rigidity
• Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
• Convex Analysis