期刊名称：International Journal of Distributed Sensor Networks
印刷版ISSN：1550-1329
电子版ISSN：1550-1477
出版年度：2019
卷号：15
期号：3
页码：1
DOI：10.1177/1550147719839642
出版社：Hindawi Publishing Corporation
摘要：In this article, we consider the sensor selection problem of choosing [Formula: see text] sensors from a set of [Formula: see text] possible sensor measurements. The sensor selection problem is a combinational optimization problem. Evaluating the performance for each possible combination is impractical unless [Formula: see text] and [Formula: see text] are small. We relax the original selection problem to be a convex optimization problem and describe a projected gradient method with Barzilai–Borwein step size to solve the proposed relaxed problem. Numerical results demonstrate that the proposed algorithm converges faster than some classical algorithms. The solution obtained by the proposed algorithm is closer to the truth.
