Global Continuation for Distance Geometry Problems

DOI10.1137/S1052623495283024zbMath0891.90168OpenAlexW2095172966MaRDI QIDQ4377575

No author found.

Publication date: 10 February 1998

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1052623495283024

zbMATH Keywords

global optimizationcontinuation methodsdistance geometry problemssmoothing transformmacromolecular modeling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of mathematical programming (90C90) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Biochemistry, molecular biology (92C40) Numerical quadrature and cubature formulas (65D32) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Distributed algorithms (68W15)

Related Items (42)

Sum of squares method for sensor network localization ⋮ Euclidean distance matrix completion problems ⋮ Solving molecular distance geometry problems by global optimization algorithms ⋮ An algorithm for realizing Euclidean distance matrices ⋮ An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data ⋮ A continuation approach to mode-finding of multivariate Gaussian mixtures and kernel density estimates ⋮ A trust-region algorithm for global optimization ⋮ Theory of semidefinite programming for sensor network localization ⋮ Nonlinear mapping and distance geometry ⋮ The discretizable distance geometry problem ⋮ Recent advances on the discretizable molecular distance geometry problem ⋮ A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem ⋮ Hyperbolic smoothing and penalty techniques applied to molecular structure determination ⋮ Distance Geometry on the Sphere ⋮ A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems ⋮ Gradient-type methods: a unified perspective in computer science and numerical analysis ⋮ Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials ⋮ Distance geometry algorithms in molecular modelling of polymer and composite systems. ⋮ (Robust) edge-based semidefinite programming relaxation of sensor network localization ⋮ Robust Euclidean embedding via EDM optimization ⋮ Graph coloring in the estimation of sparse derivative matrices: Instances and applications ⋮ Local optima smoothing for global optimization ⋮ Discretization orders for distance geometry problems ⋮ Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints ⋮ The discretizable molecular distance geometry problem ⋮ On the computation of protein backbones by using artificial backbones of hydrogens ⋮ Extending the geometric build-up algorithm for the molecular distance geometry problem ⋮ The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems ⋮ A smoothing method of global optimization that preserves global minima ⋮ An algorithm for nonlinear optimization problems with binary variables ⋮ Geometric algebra to describe the exact discretizable molecular distance geometry problem for an arbitrary dimension ⋮ An application of a global optimization parametrization method on macromolecular structure problem ⋮ A novel canonical dual computational approach for prion AGAAAAGA amyloid fibril molecular modeling ⋮ Positive semidefinite relaxations for distance geometry problems. ⋮ Euclidean Distance Matrices and Applications ⋮ Unnamed Item ⋮ Molecular distance geometry methods: from continuous to discrete ⋮ Global optimization based on local searches ⋮ Global optimization based on local searches ⋮ Double variable neighbourhood search with smoothing for the molecular distance geometry problem ⋮ A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation ⋮ Optimal direct determination of sparse Jacobian matrices

Uses Software

• GQTPAR

This page was built for publication: Global Continuation for Distance Geometry Problems