Structure method for solving the nearest Euclidean distance matrix problem

DOI10.1186/1029-242X-2014-491MaRDI QIDQ261791zbMATH OpenOpenAlexWikidataFDO

Authors Suliman Al-Homidan

Publication date 24 March 2016

Published in Journal of Inequalities and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1186/1029-242x-2014-491

zbMATH Keywords

convergencenumerical resultBFGS methodEuclidean distance matrixNewton methodpositive semidefinite matrixsmooth unconstrained minimization problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Recommendations

• scientific article; zbMATH DE number 1329054
• Computing the nearest Euclidean distance matrix with low embedding dimensions
• The best Euclidean fit to a given distance matrix in prescribed dimensions
• The cone of distance matrices
• An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix

Cites work

• scientific article; zbMATH DE number 1243473 (Why is no real title available?)
• scientific article; zbMATH DE number 1329054 (Why is no real title available?)
• An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
• Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Rapid calculation of coordinates from distance matrices
• The theory and practice of distance geometry

Cited in

(8)

• Computing the nearest Euclidean distance matrix with low embedding dimensions
• Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
• A semismooth Newton method for the nearest Euclidean distance matrix problem
• The cell matrix closest to a given Euclidean distance matrix
• Methods for constructing distance matrices and the inverse eigenvalue problem
• The best Euclidean fit to a given distance matrix in prescribed dimensions
• scientific article; zbMATH DE number 4069097 (Why is no real title available?)
• Second-order cone and semidefinite methods for the bisymmetric matrix approximation problem

This page was built for publication: Structure method for solving the nearest Euclidean distance matrix problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q261791)