Global Continuation for Distance Geometry Problems
From MaRDI portal
continuation methodsdistance geometry problemsglobal optimizationmacromolecular modelingsmoothing transform
Numerical methods based on nonlinear programming (49M37) Numerical quadrature and cubature formulas (65D32) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15) Nonlinear programming (90C30) Applications of mathematical programming (90C90) Biochemistry, molecular biology (92C40) 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
(47)- 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
- A stochastic/perturbation global optimization algorithm for distance geometry problems
- Distance geometry algorithms in molecular modelling of polymer and composite systems.
- Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- A novel canonical dual computational approach for prion AGAAAAGA amyloid fibril molecular modeling
- The discretizable distance geometry problem
- Recent advances on the discretizable molecular distance geometry problem
- Distance geometry optimization for protein structures
- Nonlinear mapping and distance geometry
- Robust Euclidean embedding via EDM optimization
- Geometric algebra to describe the exact discretizable molecular distance geometry problem for an arbitrary dimension
- 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
- Graph coloring in the estimation of sparse derivative matrices: Instances and applications
- A smoothing method of global optimization that preserves global minima
- Euclidean distance matrices and applications
- Optimal direct determination of sparse Jacobian matrices
- Distance geometry on the sphere
- Molecular distance geometry methods: from continuous to discrete
- An algorithm for realizing Euclidean distance matrices
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- scientific article; zbMATH DE number 1187130 (Why is no real title available?)
- Hyperbolic smoothing and penalty techniques applied to molecular structure determination
- Gradient-type methods: a unified perspective in computer science and numerical analysis
- scientific article; zbMATH DE number 1101492 (Why is no real title available?)
- Maxent-stress optimization of 3D biomolecular models
- Euclidean distance matrix completion problems
- On the computation of protein backbones by using artificial backbones of hydrogens
- Local optima smoothing for global optimization
- Global optimization based on local searches
- Global optimization based on local searches
- Positive semidefinite relaxations for distance geometry problems.
- A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems
- (Robust) edge-based semidefinite programming relaxation of sensor network localization
- 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
- Deep learning with Gaussian continuation
- An algorithm for nonlinear optimization problems with binary variables
- Sum of squares method for sensor network localization
- Solving molecular distance geometry problems by global optimization algorithms
- A trust-region algorithm for global optimization
- Theory of semidefinite programming for sensor network localization
- Extending the geometric build-up algorithm for the molecular distance geometry problem
- An application of a global optimization parametrization method on macromolecular structure problem
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)
