The Molecule Problem: Exploiting Structure in Global Optimization
From MaRDI portal
Publication:4862785
DOI10.1137/0805040zbMath0844.05093OpenAlexW1975519273MaRDI QIDQ4862785
Publication date: 18 August 1996
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/d19178d1850628aefc4b8cd75039c4f7782f8f42
optimizationrigiditypenalty functioninteratomic distancesintermolecular distancesstructure of a moleculeX ray data
Related Items (38)
The unassigned distance geometry problem ⋮ Hybrid spectral gradient method for the unconstrained minimization problem ⋮ Euclidean distance matrix completion problems ⋮ An extension of the angular synchronization problem to the heterogeneous setting ⋮ An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data ⋮ Planar straight-line realizations of 2-trees with prescribed edge lengths ⋮ Stable Camera Motion Estimation Using Convex Programming ⋮ Cuts, matrix completions and graph rigidity ⋮ Theory of semidefinite programming for sensor network localization ⋮ Generically globally rigid graphs have generic universally rigid frameworks ⋮ The realizable extension problem and the weighted graph \((K _{3,3}, l)\) ⋮ A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem ⋮ Hyperbolic smoothing and penalty techniques applied to molecular structure determination ⋮ LRA: local rigid averaging of stretchable non-rigid shapes ⋮ On the uniqueness of Euclidean distance matrix completions. ⋮ Least-squares approximations in geometric buildup for solving distance geometry problems ⋮ Distance geometry algorithms in molecular modelling of polymer and composite systems. ⋮ Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures ⋮ Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian ⋮ Rigid versus unique determination of protein structures with geometric buildup ⋮ Assigned and unassigned distance geometry: applications to biological molecules and nanostructures ⋮ Pebble game algorithms and sparse graphs ⋮ The discretizable molecular distance geometry problem ⋮ Semidefinite programming for discrete optimization and matrix completion problems ⋮ Globally rigid circuits of the direction-length rigidity matroid ⋮ Extending the geometric build-up algorithm for the molecular distance geometry problem ⋮ Series parallel linkages ⋮ On the uniqueness of Euclidean distance matrix completions: the case of points in general position ⋮ Connected rigidity matroids and unique realizations of graphs ⋮ Positive semidefinite relaxations for distance geometry problems. ⋮ Euclidean Distance Matrices and Applications ⋮ Minimum size highly redundantly rigid graphs in the plane ⋮ Molecular distance geometry methods: from continuous to discrete ⋮ GENERIC UNLABELED GLOBAL RIGIDITY ⋮ Diagonally Dominant Programming in Distance Geometry ⋮ Extremal families of redundantly rigid graphs in three dimensions ⋮ A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation ⋮ Searching for spreads and packings
This page was built for publication: The Molecule Problem: Exploiting Structure in Global Optimization
