An Inexact Smoothing Newton Method for Euclidean Distance Matrix Optimization Under Ordinal Constraints

DOI10.4208/jcm.1702-m2016-0748zbMath1413.90265OpenAlexW2621372483MaRDI QIDQ4688143

Qing-Na Li, Hou-Duo Qi

Publication date: 22 October 2018

Published in: Journal of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://eprints.soton.ac.uk/412450/1/revisedEDM.pdf

zbMATH Keywords

smoothing Newton methodnonmetric multidimensional scalingEuclidean distance embeddingordinal constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items (1)

Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints

This page was built for publication: An Inexact Smoothing Newton Method for Euclidean Distance Matrix Optimization Under Ordinal Constraints