Problems of distance geometry and convex properties of quadratic maps

DOI10.1007/BF02574037zbMath0829.05025MaRDI QIDQ1346137

Alexander I. Barvinok

Publication date: 10 January 1996

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131355

zbMATH Keywords

convexity; Euclidean space; distance; distance geometry; quadratic maps

Mathematics Subject Classification ID

05C12: Distance in graphs

51K05: General theory of distance geometry

Related Items

Computational enhancements in low-rank semidefinite programming, Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems, On the S-procedure and some variants, Theory of semidefinite programming for sensor network localization, Kalman-Popov-Yakubovich Lemma and the \(S\)-procedure: a historical essay, Measure concentration in optimization, Semidefinite programming in combinatorial optimization, Cuts, matrix completions and graph rigidity, On convex generalized systems, Molecular conformation search by distance matrix perturbations, Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems

Cites Work

• Topology of quadratic maps and Hessians of smooth maps
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Second-Order Rigidity and Prestress Stability for Tensegrity Frameworks
• The Toeplitz-Hausdorff Theorem Explained
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item