The Metric Nearness Problem

DOI10.1137/060653391zbMath1172.05018OpenAlexW1974906551WikidataQ59750762 ScholiaQ59750762MaRDI QIDQ3609032

Suvrit Sra, Inderjit S. Dhillon, Joel A. Tropp, Justin Brickell

Publication date: 6 March 2009

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/51037d62a6180ee29e660eec9ea213ee85e05943

zbMATH Keywords

metrictriangle inequalitydistance matrixall pairs shortest pathsmatrix nearness problemsmetric nearness

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Metric spaces, metrizability (54E35) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Complexity and performance of numerical algorithms (65Y20)

Related Items (6)

Metric violation distance: hardness and approximation ⋮ A dual basis approach to multidimensional scaling ⋮ Indefinite Proximity Learning: A Review ⋮ Ground metric learning on graphs ⋮ Unnamed Item ⋮ Metric-Constrained Optimization for Graph Clustering Algorithms

This page was built for publication: The Metric Nearness Problem