IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v15y2019i3p1550147719839642.html
   My bibliography  Save this article

New gradient methods for sensor selection problems

Author

Listed:
  • De Zhang
  • Mingqiang Li
  • Feng Zhang
  • Maojun Fan

Abstract

In this article, we consider the sensor selection problem of choosing T sensors from a set of m possible sensor measurements. The sensor selection problem is a combinational optimization problem. Evaluating the performance for each possible combination is impractical unless m and T 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.

Suggested Citation

  • De Zhang & Mingqiang Li & Feng Zhang & Maojun Fan, 2019. "New gradient methods for sensor selection problems," International Journal of Distributed Sensor Networks, , vol. 15(3), pages 15501477198, March.
    • Handle: RePEc:sae:intdis:v:15:y:2019:i:3:p:1550147719839642
    DOI: 10.1177/1550147719839642
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147719839642
    Download Restriction: no
    File URL: https://libkey.io/10.1177/1550147719839642?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Yurii NESTEROV & Sebastian U. STICH, 2017. "Efficiency of the accelerated coordinate descent method on structured optimization problems," LIDAM Reprints CORE 2845, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Mingqiang Li & Congying Han & Ruxin Wang & Tiande Guo, 2017. "Shrinking gradient descent algorithms for total variation regularized image denoising," Computational Optimization and Applications, Springer, vol. 68(3), pages 643-660, December.
    3. E. L. Lawler & D. E. Wood, 1966. "Branch-and-Bound Methods: A Survey," Operations Research, INFORMS, vol. 14(4), pages 699-719, August.
    4. Nguyen, Nam-Ky & Miller, Alan J., 1992. "A review of some exchange algorithms for constructing discrete D-optimal designs," Computational Statistics & Data Analysis, Elsevier, vol. 14(4), pages 489-498, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kezong Tang & Xiong-Fei Wei & Yuan-Hao Jiang & Zi-Wei Chen & Lihua Yang, 2023. "An Adaptive Ant Colony Optimization for Solving Large-Scale Traveling Salesman Problem," Mathematics, MDPI, vol. 11(21), pages 1-26, October.
    2. Weiqiang Pan & Zhilong Shan & Ting Chen & Fangjiong Chen & Jing Feng, 2016. "Optimal pilot design for OFDM systems with non-contiguous subcarriers based on semi-definite programming," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 63(2), pages 297-305, October.
    3. Arnouts, Heidi & Goos, Peter, 2010. "Update formulas for split-plot and block designs," Computational Statistics & Data Analysis, Elsevier, vol. 54(12), pages 3381-3391, December.
    4. Fox, B. L. & Lenstra, J. K. & Rinnooy Kan, A. H. G. & Schrage, L. E., 1977. "Branching From The Largest Upper Bound: Folklore And Facts," Econometric Institute Archives 272158, Erasmus University Rotterdam.
    5. Notte, Gastón & Pedemonte, Martín & Cancela, Héctor & Chilibroste, Pablo, 2016. "Resource allocation in pastoral dairy production systems: Evaluating exact and genetic algorithms approaches," Agricultural Systems, Elsevier, vol. 148(C), pages 114-123.
    6. Nguyen, Nam-Ky & Liu, Min-Qian, 2008. "An algorithmic approach to constructing mixed-level orthogonal and near-orthogonal arrays," Computational Statistics & Data Analysis, Elsevier, vol. 52(12), pages 5269-5276, August.
    7. Juan F. R. Herrera & José M. G. Salmerón & Eligius M. T. Hendrix & Rafael Asenjo & Leocadio G. Casado, 2017. "On parallel Branch and Bound frameworks for Global Optimization," Journal of Global Optimization, Springer, vol. 69(3), pages 547-560, November.
    8. Gautam Mitra & Frank Ellison & Alan Scowcroft, 2007. "Quadratic programming for portfolio planning: Insights into algorithmic and computational issues Part II — Processing of portfolio planning models with discrete constraints," Journal of Asset Management, Palgrave Macmillan, vol. 8(4), pages 249-258, November.
    9. Efrat Taig & Ohad Ben-Shahar, 2019. "Gradient Surfing: A New Deterministic Approach for Low-Dimensional Global Optimization," Journal of Optimization Theory and Applications, Springer, vol. 180(3), pages 855-878, March.
    10. Godolphin, J.D. & Warren, H.R., 2014. "An efficient procedure for the avoidance of disconnected incomplete block designs," Computational Statistics & Data Analysis, Elsevier, vol. 71(C), pages 1134-1146.
    11. Sung Jung, Joo & Jin Yum, Bong, 1996. "Construction of exact D-optimal designs by tabu search," Computational Statistics & Data Analysis, Elsevier, vol. 21(2), pages 181-191, February.
    12. Ekart, Aniko & Nemeth, S. Z., 2005. "Stability analysis of tree structured decision functions," European Journal of Operational Research, Elsevier, vol. 160(3), pages 676-695, February.
    13. Rosato, Paolo & Stellin, Giuseppe, 1995. "MULTI CRITERIA ANALYSIS IN FARM MANAGEMENT FOLLOWING THE COMMON AGRICULTURAL POLICY REFORM: AN APPLICATION OF MULTI-OBJECTIVE INTEGER LINEAR PROGRAMMING; Proceedings of the 4th Minnesota Padova Confer," Working Papers 14414, University of Minnesota, Center for International Food and Agricultural Policy.
    14. Jiancheng Long & Wai Yuen Szeto, 2019. "Link-Based System Optimum Dynamic Traffic Assignment Problems in General Networks," Operations Research, INFORMS, vol. 67(1), pages 167-182, January.
    15. Wang, Lizhi & Nikouei Mehr, Maryam, 2019. "An optimization approach to epistasis detection," European Journal of Operational Research, Elsevier, vol. 274(3), pages 1069-1076.
    16. Kyoungmi Hwang & Dohyun Kim & Kyungsik Lee & Chungmok Lee & Sungsoo Park, 2017. "Embedded variable selection method using signomial classification," Annals of Operations Research, Springer, vol. 254(1), pages 89-109, July.
    17. CUERVO, Daniel Palhazi & GOOS, Peter & SÖRENSEN, Kenneth, 2013. "An iterated local search algorithm for the construction of large scale D-optimal experimental designs," Working Papers 2013006, University of Antwerp, Faculty of Business and Economics.
    18. de Mast, Jeroen, 2011. "The tactical use of constraints and structure in diagnostic problem solving," Omega, Elsevier, vol. 39(6), pages 702-709, December.
    19. Robin Mueller-Bady & Martin Kappes & Inmaculada Medina-Bulo & Francisco Palomo-Lozano, 2019. "An evolutionary hybrid search heuristic for monitor placement in communication networks," Journal of Heuristics, Springer, vol. 25(6), pages 861-899, December.
    20. Szu Hui Ng & Stephen E. Chick, 2004. "Design of follow‐up experiments for improving model discrimination and parameter estimation," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(8), pages 1129-1148, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:15:y:2019:i:3:p:1550147719839642. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.