A novel low-rank matrix completion approach to estimate missing entries in Euclidean distance matrix

DOI10.1007/s40314-018-0613-7zbMath1400.15027arXiv1711.06182OpenAlexW2964317840WikidataQ62562094 ScholiaQ62562094MaRDI QIDQ1993487

Nilson J. M. Moreira, Cristiano Torezzan, Carlile C. Lavor, Leonardo Tomazeli Duarte

Publication date: 5 November 2018

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.06182

zbMATH Keywords

matrix completionEuclidean distance matrix

Mathematics Subject Classification ID

Related Items (5)

Unassigned distance geometry and molecular conformation problems ⋮ A two-phase rank-based algorithm for low-rank matrix completion ⋮ Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures ⋮ On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data ⋮ Cloud-based ERP system selection based on extended probabilistic linguistic MULTIMOORA method and Choquet integral operator

Uses Software

• softImpute

Cites Work

• Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
• Affine matrix rank minimization problem via non-convex fraction function penalty
• Exact matrix completion via convex optimization
• A Singular Value Thresholding Algorithm for Matrix Completion
• Semidefinite Programming
• Euclidean Distance Geometry and Applications
• Unnamed Item
• Unnamed Item

This page was built for publication: A novel low-rank matrix completion approach to estimate missing entries in Euclidean distance matrix