Answers are grounded in this paper and cite their sources.
In this letter, a new sparsity-promoting penalty function is introduced for sensor selection problems in field reconstruction, which has the property of avoiding scenarios where the same sensors are successively selected. Using a reweighted ℓ 1 relaxation of the ℓ 0 norm, the sensor selection problem is reformulated as a convex quadratic program. In order to handle large-scale problems, we also present two fast algorithms: accelerated proximal gradient method and alternating direction method of multipliers. Numerical results are provided to demonstrate the effectiveness of our approaches.
No takes yet. Share an insight, caveat, or question.
Liu et al. (2014) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: