Application of rectangular full packed and blocked hybrid matrix formats in semidefinite programming for sensor network localization

Authors:
Jacek Błaszczyk;Ewa Niewiadomska-Szynkiewicz;Michał Marks
Affiliations:
Institute of Control and Computation Engineering, Faculty of Electronics and Information Technology, Warsaw University of Technology, Warsaw, Poland;Institute of Control and Computation Engineering, Faculty of Electronics and Information Technology, Warsaw University of Technology, Warsaw, Poland;Institute of Control and Computation Engineering, Faculty of Electronics and Information Technology, Warsaw University of Technology, Warsaw, Poland
Venue:
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Year:
2007

Citing 7
Cited 0

Semidefinite programming for ad hoc wireless sensor network localization

Proceedings of the 3rd international symposium on Information processing in sensor networks
Localization from Connectivity in Sensor Networks

IEEE Transactions on Parallel and Distributed Systems
A fully portable high performance minimal storage hybrid format Cholesky algorithm

ACM Transactions on Mathematical Software (TOMS)
Simulated Annealing based Localization in Wireless Sensor Network

LCN '05 Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary
Algorithm 865: Fortran 95 subroutines for Cholesky factorization in block hybrid format

ACM Transactions on Mathematical Software (TOMS)
Implementation of a primal—dual method for SDP on a shared memory parallel architecture

Computational Optimization and Applications
Rectangular full packed format for LAPACK algorithms timings on several computers

PARA'06 Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper1 addresses issues associated with reduction of memory usage for a semidefinite programming (SDP) relaxation based method and its application to position estimation problem in ad-hoc wireless sensor networks. We describe two new CSDP solvers (semidefinite programming in C) using two algorithms for Cholesky factorization implementing RFP and BHF matrix storage formats and different implementations of BLAS/LAPACK libraries (Netlib's BLAS/LAPACK, sequential and parallel versions of ATLAS, Intel MKL and GotoBLAS). The numerical results given and discussed in the final part of the paper show that using both RFP and BHF data formats preserve high numerical performance of the LAPACK full data format while using half the computer storage.