Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints

Si-Tong Lu, Miao Zhang and Qing-Na Li ()
Additional contact information
Si-Tong Lu: Beijing Institute of Technology
Miao Zhang: Beijing Institute of Technology
Qing-Na Li: Beijing Institute of Technology

Computational Optimization and Applications, 2020, vol. 76, issue 2, No 8, 535-569

Abstract: Abstract Euclidean distance matrix optimization with ordinal constraints (EDMOC) has found important applications in sensor network localization and molecular conformation. It can also be viewed as a matrix formulation of multidimensional scaling, which is to embed n points in a r-dimensional space such that the resulting distances follow the ordinal constraints. The ordinal constraints, though proved to be quite useful, may result in only zero solution when too many are added, leaving the feasibility of EDMOC as a question. In this paper, we first study the feasibility of EDMOC systematically. We show that if $$r\ge n-2$$r≥n-2, EDMOC always admits a nontrivial solution. Otherwise, it may have only zero solution. The latter interprets the numerical observations of ’crowding phenomenon’. Next we overcome two obstacles in designing fast algorithms for EDMOC, i.e., the low-rankness and the potential huge number of ordinal constraints. We apply the technique developed in Zhou et al. (IEEE Trans Signal Process 66(3):4331–4346 2018) to take the low rank constraint as the conditional positive semidefinite cone with rank cut. This leads to a majorization penalty approach. The ordinal constraints are left to the subproblem, which is exactly the weighted isotonic regression, and can be solved by the enhanced implementation of Pool Adjacent Violators Algorithm (PAVA). Extensive numerical results demonstrate the superior performance of the proposed approach over some state-of-the-art solvers.

Keywords: Euclidean distance matrix; Majorized penalty approach; Feasibility; Nonmetric multidimensional scaling (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10589-020-00189-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:76:y:2020:i:2:d:10.1007_s10589-020-00189-9

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-020-00189-9

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().