Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. programming

DOI10.1023/A:1026016804633zbMath1064.90036OpenAlexW1582165156MaRDI QIDQ1430176

Hoai An Le Thi

Publication date: 27 May 2004

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1026016804633

zbMATH Keywords

continuation methoddistance geometry problemsreformulationmolecular optimizationD.C. algorithm (DCA)Gaussian transform

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Variations and extension of the convex-concave procedure ⋮ DC Programming Approaches for BMI and QMI Feasibility Problems ⋮ Alternating DCA for reduced-rank multitask linear regression with covariance matrix estimation ⋮ Recent advances on the interval distance geometry problem ⋮ An efficient DC programming approach for portfolio decision with higher moments ⋮ A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems ⋮ DC programming and DCA: thirty years of developments ⋮ The discretizable molecular distance geometry problem ⋮ 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 ⋮ An application of a global optimization parametrization method on macromolecular structure problem ⋮ Unnamed Item ⋮ Molecular distance geometry methods: from continuous to discrete ⋮ A Euclidean distance matrix model for protein molecular conformation ⋮ DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology