Hyperbolic smoothing and penalty techniques applied to molecular structure determination
From MaRDI portal
Publication:408445
DOI10.1016/j.orl.2011.07.007zbMath1235.90121OpenAlexW1999003990WikidataQ62562176 ScholiaQ62562176MaRDI QIDQ408445
Adilson Elias Xavier, Michael Souza, Nelson F. Maculan, Carlile C. Lavor
Publication date: 5 April 2012
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2011.07.007
global optimizationsmoothing techniquesprotein structuremolecular distance geometry problemNMR experiments
Related Items
Generalization of hyperbolic smoothing approach for non-smooth and non-Lipschitz functions ⋮ Clifford algebra and the discretizable molecular distance geometry problem ⋮ Minimal NMR distance information for rigidity of protein graphs ⋮ Discretization orders for protein side chains ⋮ On the polynomiality of finding \(^K\text{DMDGP}\) re-orders ⋮ A quantum approach to the discretizable molecular distance geometry problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
- Molecular modeling and simulation. An interdisciplinary guide
- Optimal covering of plane domains by circles via hyperbolic smoothing
- Modern homotopy methods in optimization
- Rigid versus unique determination of protein structures with geometric buildup
- Extending the geometric build-up algorithm for the molecular distance geometry problem
- Double variable neighbourhood search with smoothing for the molecular distance geometry problem
- Analysis and solution of the ill-posed inverse heat conduction problem
- The Solution of the Metric STRESS and SSTRESS Problems in Multidimensional Scaling Using Newtons Method
- A stochastic/perturbation global optimization algorithm for distance geometry problems
- Distance geometry optimization for protein structures
- An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
- A smooth hyperbolic approximation to the Mohr-Coulomb yield criterion
- Hyperbolic Penalty: A New Method for Nonlinear Programming with Inequalities
- An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
- Hyperbolic approximations for a Cauchy problem for the heat equation
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
- Global Continuation for Distance Geometry Problems
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- The Molecule Problem: Exploiting Structure in Global Optimization
- A Nonlinear Approximation Method for Solving a Generalized Rectangular Distance Weber Problem
