Structure method for solving the nearest Euclidean distance matrix problem

DOI10.1186/1029-242X-2014-491zbMath1336.65106OpenAlexW2165513132WikidataQ59321171 ScholiaQ59321171MaRDI QIDQ261791

Suliman Al-Homidan

Publication date: 24 March 2016

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

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

zbMATH Keywords

convergenceNewton methodBFGS methodpositive semidefinite matrixnumerical resultEuclidean distance matrixsmooth unconstrained minimization problem

Mathematics Subject Classification ID

Related Items (1)

Second-order cone and semidefinite methods for the bisymmetric matrix approximation problem

Cites Work

• The theory and practice of distance geometry
• Rapid calculation of coordinates from distance matrices
• Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
• An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Unnamed Item
• Unnamed Item

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