On Farkas lemma and dimensional rigidity of bar frameworks

DOI10.1016/j.laa.2015.08.030zbMath1321.90097arXiv1405.2301OpenAlexW2962921555WikidataQ124972638 ScholiaQ124972638MaRDI QIDQ498344

Abdo Y. Alfakih

Publication date: 28 September 2015

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

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

zbMATH Keywords

semidefinite programminguniversal rigidityFarkas lemmafacial reductionbar frameworksdimensional rigiditystress matrices

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

Singularity Degree of the Positive Semidefinite Matrix Completion Problem ⋮ Exact Duality in Semidefinite Programming Based on Elementary Reformulations

Cites Work

• Unnamed Item
• Unnamed Item
• Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
• Regularizing the abstract convex program
• Cones of diagonally dominant matrices
• On dimensional rigidity of bar-and-joint frameworks
• The lattice of faces of a finite dimensional cone
• Handbook of semidefinite programming. Theory, algorithms, and applications

This page was built for publication: On Farkas lemma and dimensional rigidity of bar frameworks