Title
Euclidean distance matrix completion problems
Abstract
Our experiments show that the method easily solves the artificial problems introduced by Moré and Wu. It also solves the 12 much more difficult protein fragment problems introduced by Hendrickson, and the six larger protein problems introduced by Grooms, Lewis and Trosset.
Year
DOI
Venue
2012
10.1080/10556788.2011.643888
Optimization Methods and Software
Keywords
Field
DocType
artificial problem,euclidean distance matrix completion,difficult protein fragment problem,larger protein problem,global optimization,symmetric matrix,quasi newton method,local minima,distance geometry,euclidean distance,cholesky factorization,multidimensional scaling
Discrete mathematics,Molecular conformation,Combinatorics,Mathematical optimization,Global optimization,Protein Fragment,Distance geometry,Mathematics,Euclidean distance matrix
Journal
Volume
Issue
ISSN
27
4-5
1055-6788
Citations 
PageRank 
References 
3
0.39
18
Authors
2
Name
Order
Citations
PageRank
Haw-ren Fang113213.24
O'Leary, Dianne P.21064222.93