sensor network localization-04

Exploiting sparsity in SDP relaxation for sensor network localization

FREE-DOWNLOADS Kim, M Kojima… – SIAM J. Optim, 2009
Abstract. A sensor network localization problem can be formulated as a quadratic optimization
problem (QOP). For quadratic optimization problems, semidefinite programming (SDP) relaxation
by Lasserre with relaxation order 1 for general polynomial optimization problems (POPs)