Positive semidefinite relaxations for distance geometry problems.

DOI10.1007/BF03167449zbMath1103.90414MaRDI QIDQ5960873

Yasutoshi Yajima

Publication date: 2002

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Biochemistry, molecular biology (92C40)

Related Items

New error measures and methods for realizing protein graphs from distance data, Diagonally Dominant Programming in Distance Geometry

Uses Software

• SDPA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonmetric individual differences multidimensional scaling: An alternating least squares method with optimal scaling features
• Convergence of the majorization method for multidimensional scaling
• A cyclic projection algorithm via duality
• The embedding problem for predistance matrices
• Solving Euclidean distance matrix completion problems via semidefinite progrmming
• Modern multidimensional scaling: theory and applications
• A stochastic/perturbation global optimization algorithm for distance geometry problems
• Distance geometry optimization for protein structures
• Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
• Nonmetric multidimensional scaling. A numerical method
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• Global Continuation for Distance Geometry Problems
• Mixed linear and semidefinite programming for combinatorial and quadratic optimization
• The Molecule Problem: Exploiting Structure in Global Optimization