Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
Authors:
- Suliman Al-HomidanSASuliman Al-Homidan
- Henry WolkowiczHWHenry Wolkowicz
- 1 September 2005
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 406, 109-141
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Approximate and exact completion problems for Euclidean distance matrices using semidefinite programmingLinear Algebra and its Applications, 2005
- The Gauss-Newton direction in semidefinite programmingOptimization Methods and Software, 2001
- Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming1999
- A connection between positive semidefinite and euclidean distance matrix completion problemsLinear Algebra and its Applications, 1998
- Connections between the real positive semidefinite and distance matrix completion problemsLinear Algebra and its Applications, 1995
- Sizing and Least-Change Secant MethodsSIAM Journal on Numerical Analysis, 1993
- The cone of distance matricesLinear Algebra and its Applications, 1991
- On certain linear mappings between inner-product and squared-distance matricesLinear Algebra and its Applications, 1988
- Properties of Euclidean and non-Euclidean distance matricesLinear Algebra and its Applications, 1985
- Monotonie und randspektrum bei vollstetigen operatorenArchive for Rational Mechanics and Analysis, 1970