Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints
From MaRDI portal
Publication:2181603
DOI10.1007/s10589-020-00189-9zbMath1467.90075arXiv2006.12128OpenAlexW3105700407WikidataQ114227032 ScholiaQ114227032MaRDI QIDQ2181603
Si-Tong Lu, Miao Zhang, Qing-Na Li
Publication date: 19 May 2020
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.12128
Related Items
An Ordinal Weighted EDM Model for Nonmetric Multidimensional Scaling, A facial reduction approach for the single source localization problem
Uses Software
Cites Work
- Computing the nearest Euclidean distance matrix with low embedding dimensions
- Conditional quadratic semidefinite programming: examples and methods
- SLOPE-adaptive variable selection via convex optimization
- An inexact primal-dual path following algorithm for convex quadratic SDP
- Properties of Euclidean and non-Euclidean distance matrices
- Robust Euclidean embedding via EDM optimization
- A Euclidean distance matrix model for protein molecular conformation
- Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation
- Modern multidimensional scaling. Theory and applications.
- Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
- Nonmetric multidimensional scaling. A numerical method
- Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
- Multidimensional scaling. I: Theory and method
- Using a Distributed SDP Approach to Solve Simulated Protein Molecular Conformation Problems
- An SDP-Based Divide-and-Conquer Algorithm for Large-Scale Noisy Anchor-Free Graph Realization
- Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints
- A Lagrangian Dual Approach to the Single-Source Localization Problem
- A Fast Matrix Majorization-Projection Method for Penalized Stress Minimization With Box Constraints
- An Inexact Smoothing Newton Method for Euclidean Distance Matrix Optimization Under Ordinal Constraints
- A Semismooth Newton Method for the Nearest Euclidean Distance Matrix Problem
- Euclidean Distance Geometry and Applications
