DC Programming Approaches for Distance Geometry Problems

DOI10.1007/978-1-4614-5128-0_13zbMath1271.65038OpenAlexW2222134608MaRDI QIDQ2841710

Hoai An Le Thi, Tao Pham Dinh

Publication date: 29 July 2013

Published in: Distance Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-5128-0_13

zbMATH Keywords

regularizationnumerical examplesdistance geometrycomputational efficiencytwo-phase algorithmlarge-scale settingmolecular optimization problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) General theory of distance geometry (51K05)

Related Items (7)

DC approximation approaches for sparse optimization ⋮ DC programming and DCA for solving Brugnano-Casulli piecewise linear systems ⋮ DC Programming and DCA for General DC Programs ⋮ Nonlinear mapping and distance geometry ⋮ DC programming and DCA: thirty years of developments ⋮ Visualizing data as objects by DC (difference of convex) optimization ⋮ DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology

This page was built for publication: DC Programming Approaches for Distance Geometry Problems