Energy-based sensor network source localization via projection onto convex sets
From MaRDI portal
Publication:4587946
DOI10.1109/TSP.2006.879312zbMath1375.94045OpenAlexW2131247345MaRDI QIDQ4587946
Alfred O. III Hero, Doron Blatt
Publication date: 30 October 2017
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tsp.2006.879312
Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items
String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases ⋮ Stochastic block projection algorithms with extrapolation for convex feasibility problems ⋮ Passive Source Localization Using Time Differences of Arrival and Gain Ratios of Arrival ⋮ An event-triggering algorithm for decentralized stochastic optimization over networks ⋮ On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints ⋮ Low complexity multiple acoustic source localization in sensor networks based on energy measurements ⋮ String-averaging algorithms for convex feasibility with infinitely many sets ⋮ Nonasymptotic convergence of stochastic proximal point algorithms for constrained convex optimization ⋮ Realistic Anchor Positioning for Sensor Localization ⋮ A generalized projection-based scheme for solving convex constrained optimization problems ⋮ General convergence analysis of stochastic first-order methods for composite optimization ⋮ Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities ⋮ Force-directed hybrid PSO-SNTO algorithm for acoustic source localization in sensor networks ⋮ Adaptive subgradient method for the split quasi-convex feasibility problems ⋮ The hybrid projection algorithm for finding the common fixed points of nonexpansive mappings and the zeroes of maximal monotone operators in Banach spaces ⋮ Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates ⋮ Iteration process for fixed point problems and zeros of maximal monotone operators ⋮ Random minibatch subgradient algorithms for convex problems with functional constraints ⋮ Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems
This page was built for publication: Energy-based sensor network source localization via projection onto convex sets