Exploiting the Degeneracy of Euclidean Distance Matrix Completion Problem

Ting Ouyang, Qingna Li*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The Euclidean distance matrix (EDM) completion problem has been widely used in molecular conformation, protein structure determination and localization. This problem can be troublesome for many off-the-shelf algorithms since it is often intended to be highly degenerate. Therefore, in this paper, we develop the facial reduction technique by exploiting this degeneracy. We characterize the minimal face of EDM cone that contains the feasible region of EDM completion problem. The strict feasibility can be ensured by restricting the problem on the minimal face. We verify our result by some toy examples.

Original languageEnglish
Title of host publication2024 7th International Conference on Computer Information Science and Application Technology, CISAT 2024
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1164-1169
Number of pages6
ISBN (Electronic)9798350375107
DOIs
Publication statusPublished - 2024
Event7th International Conference on Computer Information Science and Application Technology, CISAT 2024 - Hangzhou, China
Duration: 12 Jul 202414 Jul 2024

Publication series

Name2024 7th International Conference on Computer Information Science and Application Technology, CISAT 2024

Conference

Conference7th International Conference on Computer Information Science and Application Technology, CISAT 2024
Country/TerritoryChina
CityHangzhou
Period12/07/2414/07/24

Keywords

  • Euclidean distance matrix
  • Facial reduction

Fingerprint

Dive into the research topics of 'Exploiting the Degeneracy of Euclidean Distance Matrix Completion Problem'. Together they form a unique fingerprint.

Cite this