An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix

1990 ◽  
Vol 11 (4) ◽  
pp. 589-600 ◽  
Author(s):  
W. Glunt ◽  
T. L. Hayden ◽  
S. Hong ◽  
J. Wells
2015 ◽  
Vol 107 ◽  
pp. 123-140 ◽  
Author(s):  
Mohammad J. Taghizadeh ◽  
Reza Parhizkar ◽  
Philip N. Garner ◽  
Hervé Bourlard ◽  
Afsaneh Asaei

Author(s):  
KYLE BRODER

Abstract We show that the elements of the dual of the Euclidean distance matrix cone can be described via an inequality on a certain weighted sum of its eigenvalues.


Sign in / Sign up

Export Citation Format

Share Document