Cooperative Wireless Sensor Network Positioning via Implicit Convex Feasibility

DOI10.1109/TSP.2013.2279770zbMath1394.94208arXiv1309.2031MaRDI QIDQ4578830

Erik G. Ström, Mohammad Gholami, Luba Tetruashvili, Yair Censor

Publication date: 22 August 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.2031

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (4)

On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery ⋮ DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS ⋮ Single landmark based collaborative multi-agent localization with time-varying range measurements and information sharing ⋮ Adaptive subgradient method for the split quasi-convex feasibility problems

This page was built for publication: Cooperative Wireless Sensor Network Positioning via Implicit Convex Feasibility