Global Continuation for Distance Geometry Problems
From MaRDI portal
global optimizationdistance geometry problemscontinuation methodssmoothing transformmacromolecular modeling
Applications of mathematical programming (90C90) Biochemistry, molecular biology (92C40) Numerical quadrature and cubature formulas (65D32) Analysis of algorithms and problem complexity (68Q25) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Distributed algorithms (68W15) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Recommendations
- Publication:4863354
- Distance geometry methods for protein structure determination
- A stochastic/perturbation global optimization algorithm for distance geometry problems
- Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. programming
- scientific article; zbMATH DE number 1101492
Cited in
(45)- Theory of semidefinite programming for sensor network localization
- scientific article; zbMATH DE number 1187130 (Why is no real title available?)
- Positive semidefinite relaxations for distance geometry problems.
- Double variable neighbourhood search with smoothing for the molecular distance geometry problem
- Hyperbolic smoothing and penalty techniques applied to molecular structure determination
- Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints
- A smoothing method of global optimization that preserves global minima
- Gradient-type methods: a unified perspective in computer science and numerical analysis
- Deep learning with Gaussian continuation
- The discretizable molecular distance geometry problem
- Extending the geometric build-up algorithm for the molecular distance geometry problem
- A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems
- On the computation of protein backbones by using artificial backbones of hydrogens
- Molecular distance geometry methods: from continuous to discrete
- An application of a global optimization parametrization method on macromolecular structure problem
- An algorithm for nonlinear optimization problems with binary variables
- A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation
- Local optima smoothing for global optimization
- Sum of squares method for sensor network localization
- Nonlinear mapping and distance geometry
- A continuation approach to mode-finding of multivariate Gaussian mixtures and kernel density estimates
- (Robust) edge-based semidefinite programming relaxation of sensor network localization
- Distance geometry optimization for protein structures
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Geometric algebra to describe the exact discretizable molecular distance geometry problem for an arbitrary dimension
- An algorithm for realizing Euclidean distance matrices
- A novel canonical dual computational approach for prion AGAAAAGA amyloid fibril molecular modeling
- An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
- A trust-region algorithm for global optimization
- Discretization orders for distance geometry problems
- Solving molecular distance geometry problems by global optimization algorithms
- Distance geometry on the sphere
- Graph coloring in the estimation of sparse derivative matrices: Instances and applications
- Global optimization based on local searches
- Global optimization based on local searches
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- Euclidean distance matrices and applications
- Recent advances on the discretizable molecular distance geometry problem
- Maxent-stress optimization of 3D biomolecular models
- Optimal direct determination of sparse Jacobian matrices
- Distance geometry algorithms in molecular modelling of polymer and composite systems.
- Euclidean distance matrix completion problems
- The discretizable distance geometry problem
- Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials
- Robust Euclidean embedding via EDM optimization
This page was built for publication: Global Continuation for Distance Geometry Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4377575)
