Positive semidefinite relaxations for distance geometry problems.

DOI10.1007/BF03167449MaRDI QIDQ5960873zbMATH OpenFDO

Authors Yasutoshi Yajima

Publication date 2002

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

Full work available at URL https://doi.org/10.1007/BF03167449

Mathematics Subject Classification ID

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

Recommendations

• Computational Experience with the Molecular Distance Geometry Problem
• A stochastic/perturbation global optimization algorithm for distance geometry problems
• The embedding problem for predistance matrices
• Solving Molecular Distance Geometry Problems Using a Continuous Optimization Approach
• scientific article; zbMATH DE number 1488890

Cites work

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

Cited in

(8)

• The embedding problem for predistance matrices
• Maximum feasible subsystems of distance geometry constraints
• Barvinok's naive algorithm in distance geometry
• Diagonally dominant programming in distance geometry
• Efficient use of semidefinite programming for selection of rotamers in protein conformations
• scientific article; zbMATH DE number 1187130 (Why is no real title available?)
• scientific article; zbMATH DE number 1488890 (Why is no real title available?)
• New error measures and methods for realizing protein graphs from distance data

Describes a project that uses

Uses Software

• SDPA

This page was built for publication: Positive semidefinite relaxations for distance geometry problems.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5960873)