We study Semidefinite Programming, SDP,relaxations for Sensor Network Localization,

We study Semidefinite Programming, SDP,relaxations for Sensor Network Localization, (2008)

Cached

Download Links

by Yichuan Ding , Nathan Krislock , Jiawei Qian , Henry Wolkowicz

BibTeX

@MISC{Ding08westudy,
    author = {Yichuan Ding and Nathan Krislock and Jiawei Qian and Henry Wolkowicz},
    title = {We study Semidefinite Programming, SDP,relaxations for Sensor Network Localization,},
    year = {2008}
}

Bookmark

OpenURL

Abstract

Citations

169	WS: Multidimensional scaling: I. theory and method - Torgerson - 1952
149	Distance Geometry and Molecular Conformation. Research Studies - Crippen, Havel - 1988
113	Semidefinite Programming for Ad Hoc Wireless Sensor Network Localization - Biswas, Ye
55	H.: Solving Euclidean distance matrix completion problems via semidefinite programming - Alfakih, Khandani, et al. - 1999
48	Remarks to Maurice Fréchet’s Article “Sur la définition axiomatique d’une classe d’espace distanciés vectoriellement applicable sur l’espace de - Schoenberg - 1935
46	Theory of semidefinite programming for sensor network localization - SO, YE
36	Semidefinite programming approaches for sensor network localization with noisy distance measurements - BISWAS, LIANG, et al. - 2006
25	A distributed method for solving semidefinite programs arising from ad hoc wireless sensor network localization - BISWAS, YE - 2006
24	Characterization of the barrier parameter of homogeneous convex cones - Guler
22	Properties of Euclidean and non-Euclidean distance matrices - GOWER - 1985
21	Finding dense subgraphs with semidefinite programming, Approximation Algorithms for Combinatorial Optimization - Srivastav, Wolf - 1998
18	A tour d’horizon on positive semidefinite and Euclidean distance matrix completion problems. In Topics in semidefinite and interior-point methods - LAURENT - 1996
18	Further relaxations of the semidefinite programming approach to sensor network localization - WANG, ZHENG, et al.
17	The Euclidean distance matrix completion problem - BAKONYI, JOHNSON - 1995
16	Approximation bounds for quadratic optimization with homogeneous quadratic constraints - LUO, SIDIROPOULOS, et al. - 2006
16	Second-order cone programming relaxation of sensor network localization - TSENG
15	Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming - AL-HOMIDAN, WOLKOWICZ
12	An SDP based approach for anchor-free 3D graph realization - BISWAS, LIANG, et al. - 2005
12	Connections between the real positive semidefinite and distance matrix completion problems - JOHNSON, TARAZAGA - 1995
9	Scalable Sensor Localization Algorithms for Wireless Sensor Networks - JIN - 2005
8	The cone of distance matrices - HAYDEN, WELLS, et al. - 1991
8	Robust semidefinite programming approaches for sensor network localization with anchors - KRISLOCK, PICCIALLI, et al. - 2006
6	Three theorems with applications to Euclidean distance matrices - FAREBROTHER - 1987
6	A unified theorem on sdp rank reduction - SO, YE, et al. - 2006
5	Facial reduction for a cone-convex programming problem - BORWEIN, WOLKOWICZ - 1980
4	The Gauss-Newton direction in semidefinite programming - Kruk, Muramatsu, et al.
3	Local results for the Gauss-Newton method on constrained rank-deficient nonlinear least squares - ERIKSSON, GULLIKSSON
3	SOCP relaxation for nonconvex optimization - TSENG - 2004
2	Invariance and efficiency of convex representations - CHUA, TUNÇEL - 2008
2	A note on the approximability of the dense subgraph problem - VERBITSKY
2	Improved approximation algorithms for MAX n n -DIRECTED-BISECTION - XU, HAN, et al.