CONNECTIONS BETWEEN THE REAL POSITIVE SEMIDEFINITE AND DISTANCE MATRIX COMPLETION PROBLEMS

被引：0

作者：

JOHNSON, CR ^{[1
]}

TARAZAGA, P ^{[1
]}

机构：

[1] UNIV PUERTO RICO,DEPT MATH,MAYAGUEZ,PR 00681

来源：

LINEAR ALGEBRA AND ITS APPLICATIONS | 1995年 / 224卷

关键词：

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Though the real symmetric positive semidefinite (PSD) matrices and the Euclidean distance matrices are closely related, exact relationships between the corresponding completion problems are not apparent. We establish strong partial relationships of two types. This permits the transfer of some insights from one problem to the other and allows computational tools for the PSD problem to be used for the distance problem.

引用

页码：375 / 391

页数：17

共 50 条

[21] Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
Sunyoung Kim
Masakazu Kojima
Martin Mevissen
Makoto Yamashita
Mathematical Programming, 2011, 129 : 33 - 68
[22] The real positive semidefinite completion problem for series-parallel graphs
Laurent, M
LINEAR ALGEBRA AND ITS APPLICATIONS, 1997, 252 : 347 - 366
[23] Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
Kim, Sunyoung
Kojima, Masakazu
Mevissen, Martin
Yamashita, Makoto
MATHEMATICAL PROGRAMMING, 2011, 129 (01) : 33 - 68
[24] Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
Al-Homidan, S
Wolkowicz, H
LINEAR ALGEBRA AND ITS APPLICATIONS, 2005, 406 : 109 - 141
[25] Kernel matrix completion by semidefinite programming
Graepel, T
ARTIFICIAL NEURAL NETWORKS - ICANN 2002, 2002, 2415 : 694 - 699
[26] CHARACTERIZATION OF A POSITIVE SEMIDEFINITE MATRIX
FAREBROTHER, RW
ECONOMETRIC THEORY, 1993, 9 (02) : 323 - 324
[27] Connections between semidefinite relaxations of the max-cut and stable set problems
Laurent, M
Poljak, S
Rendl, F
MATHEMATICAL PROGRAMMING, 1997, 77 (02) : 225 - 246
[28] Half thresholding eigenvalue algorithm for semidefinite matrix completion
CHEN YongQiang
LUO ZiYan
XIU NaiHua
Science China(Mathematics), 2015, 58 (09) : 2015 - 2032
[29] Connections between semidefinite relaxations of the max-cut and stable set problems
Monique Laurent
Svatopluk Poljak
Franz Rendl
Mathematical Programming, 1997, 77 : 225 - 246
[30] TOEPLITZ AND POSITIVE SEMIDEFINITE COMPLETION PROBLEM FOR CYCLE GRAPH
何明
吴国宝
NumericalMathematicsAJournalofChineseUniversities(EnglishSeries), 2005, (01) : 67 - 78

← 1 2 3 4 5 →