Solving Euclidean distance matrix completion problems via semidefinite progrmming
type: Item
instance of: scholarly article
title: Solving Euclidean distance matrix completion problems via semidefinite progrmming
zbMATH Open document ID: 1040.90537
DOI: 10.1023/A:1008655427845
author: Abdo Y. Alfakih
author: Henry Wolkowicz
author: A. K. Khandani
published in: Computational Optimization and Applications
publication date: 1999-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 1324689
zbMATH Keywords: Euclidean distance matrices
zbMATH Keywords: semidefinite programming
zbMATH Keywords: completion problems
zbMATH Keywords: primal-dual interior-point method
MaRDI profile type: Publication
full work available at URL: a:1008655427845
OpenAlex ID: W2125947724
description: scientific article; zbMATH DE number 1324689