Algorithm 920: SFSDP: a sparse version of full semidefinite programming relaxation for sensor network localization problems

DOI10.1145/2331130.2331135MaRDI QIDQ2989170zbMATH OpenOpenAlexWikidataFDO

Authors Sunyoung Kim, Masakazu Kojima, Hayato Waki, Makoto Yamashita

Publication date 19 May 2017

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2331130.2331135

zbMATH Keywords

semidefinite programming relaxationMatlab software packagesensor network localization problemssparsity exploitation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Packaged methods for numerical algorithms (65Y15) Semidefinite programming (90C22)

Recommendations

• Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
• Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
• Explicit sensor network localization using semidefinite representations and facial reductions
• (Robust) edge-based semidefinite programming relaxation of sensor network localization
• Semidefinite Programming for Sensor Network and Graph Localization

Cited in

(14)

• Exploiting sparsity in SDP relaxation of polynomial optimization problems
• Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
• Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
• Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
• Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
• Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials
• Fast implementation for semidefinite programs with positive matrix completion
• A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems
• Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier
• A modified quasisecant method for global optimization
• Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
• Canonical primal-dual algorithm for solving fourth-order polynomial minimization problems
• Euclidean distance matrices and applications
• Robust Euclidean embedding via EDM optimization

Describes a project that uses

Uses Software

• SFSDP
• SeDuMi
• SDPA
• Matlab

This page was built for publication: Algorithm 920: SFSDP: a sparse version of full semidefinite programming relaxation for sensor network localization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989170)