Academic Journal
Barvinok’s naive algorithm in Distance Geometry
| العنوان: | Barvinok’s naive algorithm in Distance Geometry |
|---|---|
| المؤلفون: | Liberti, Leo, Vu, Ky |
| المساهمون: | Laboratoire d'informatique de l'École polytechnique Palaiseau (LIX), École polytechnique (X), Institut Polytechnique de Paris (IP Paris)-Institut Polytechnique de Paris (IP Paris)-Centre National de la Recherche Scientifique (CNRS) |
| المصدر: | ISSN: 0167-6377. |
| بيانات النشر: | HAL CCSD Elsevier |
| سنة النشر: | 2018 |
| مصطلحات موضوعية: | distance geometry, concentration of measure, protein structure, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC] |
| الوصف: | International audience ; In 1997, A. Barvinok gave a probabilistic algorithm to derive a near-feasible solution of a quadratically (equation) constrained problem from its semidefinite relaxation. We generalize this algorithm to handle matrix variables instead of vectors, and to two-sided inequalities instead of equations. We derive a heuristic for the distance geometry problem, and showcase its computational performance on a set of instances related to protein conformation. |
| نوع الوثيقة: | article in journal/newspaper |
| اللغة: | English |
| Relation: | hal-02105083; https://hal.science/hal-02105083; https://hal.science/hal-02105083/document; https://hal.science/hal-02105083/file/orl18.pdf |
| DOI: | 10.1016/j.orl.2018.06.006 |
| الاتاحة: | https://hal.science/hal-02105083 https://hal.science/hal-02105083/document https://hal.science/hal-02105083/file/orl18.pdf https://doi.org/10.1016/j.orl.2018.06.006 |
| Rights: | info:eu-repo/semantics/OpenAccess |
| رقم الانضمام: | edsbas.F0963552 |
| قاعدة البيانات: | BASE |
| DOI: | 10.1016/j.orl.2018.06.006 |
|---|