SFSDP
Algorithm 920: SFSDP: A Sparse Version of Full Semidefinite Programming Relaxation for Sensor Network Localization Problems SFSDP is a Matlab package for solving sensor network localization (SNL) problems. These types of problems arise in monitoring and controlling applications using wireless sensor networks. SFSDP implements the semidefinite programming (SDP) relaxation proposed in Kim et al. [2009] for sensor network localization problems, as a sparse version of the full semidefinite programming relaxation (FSDP) by Biswas and Ye [2004]. To improve the efficiency of FSDP, SFSDP exploits the aggregated and correlative sparsity of a sensor network localization problem. As a result, SFSDP can handle much larger problems than other software as well as three-dimensional anchor-free problems. SFSDP analyzes the input data of a sensor network localization problem, solves the problem, and displays the computed locations of sensors. SFSDP also includes the features of generating test problems for numerical experiments
Keywords for this software
References in zbMATH (referenced in 25 articles )
Showing results 1 to 20 of 25.
Sorted by year (- Jeyakumar, V.; Kim, S.; Lee, G.M.; Li, G.: Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets (2016)
- Jeyakumar, V.; Lasserre, J.B.; Li, G.; Phạm, T.S.: Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems (2016)
- Qi, Hou-Duo; Yuan, Xiaoming: Computing the nearest Euclidean distance matrix with low embedding dimensions (2014)
- Wu, Changzhi; Li, Chaojie; Long, Qiang: A DC programming approach for sensor network localization with uncertainties in anchor positions (2014)
- Bezdek, Károly; Deza, Antoine; Ye, Yinyu: Selected open problems in discrete geometry and optimization (2013)
- Kim, Sunyoung; Kojima, Masakazu: A continuation method for large-sized sensor network localization problems (2013)
- Kojima, Masakazu; Yamashita, Makoto: Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization (2013)
- Malick, Jér^ome; Roupin, Frédéric: On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods (2013)
- Gouveia, João; Pong, Ting Kei: Comparing SOS and SDP relaxations of sensor network localization (2012)
- Kim, Sunyoung; Kojima, Masakazu: Exploiting sparsity in SDP relaxation of polynomial optimization problems (2012)
- Krislock, Nathan; Wolkowicz, Henry: Euclidean distance matrices and applications (2012)
- Lakhbab, Halima; El Bernoussi, Souad: A hybrid method based on particle swarm optimization and nonmonotone spectral gradient method for unconstrained optimization problem (2012)
- Nie, Jiawang; Wang, Li: Regularization methods for SDP relaxations in large-scale polynomial optimization (2012)
- Pong, Ting Kei: Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints (2012)
- Yamashita, Makoto; Fujisawa, Katsuki; Fukuda, Mituhiro; Nakata, Kazuhide; Nakata, Maho: Algorithm 925, parallel solver for semidefinite programming problem having sparse Schur complement matrix (2012)
- Zheng, Zhenzhen; Luo, Xinlong; Wu, Zhijun: Geometric buildup algorithms for sensor network localization (2012)
- Alfakih, Abdo Y.; Anjos, Miguel F.; Piccialli, Veronica; Wolkowicz, Henry: Euclidean distance matrices, semidefinite programming and sensor network localization (2011)
- Kim, Sunyoung; Kojima, Masakazu; Mevissen, Martin; Yamashita, Makoto: Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion (2011)
- Pong, Ting Kei; Tseng, Paul: (Robust) edge-based semidefinite programming relaxation of sensor network localization (2011)
- Kojima, Masakazu: Exploiting structured sparsity in large scale semidefinite programming problems (2010)