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. Coşar Gözükırmızı & Metin Demiralp, 2019. "Solving ODEs by Obtaining Purely Second Degree Multinomials via Branch and Bound with Admissible Heuristic," Mathematics, MDPI, vol. 7(4), pages 1-23, April.
    2. 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.
    3. Amine Lamine & Mahdi Khemakhem & Brahim Hnich & Habib Chabchoub, 2016. "Solving constrained optimization problems by solution-based decomposition search," Journal of Combinatorial Optimization, Springer, vol. 32(3), pages 672-695, October.
    4. 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.
    5. 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.
    6. Drexl, Andreas, 1990. "Scheduling of project networks by job assignment," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 247, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    7. Yi-Feng Hung & Wei-Chih Chen, 2011. "A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm," Journal of Global Optimization, Springer, vol. 51(1), pages 133-148, September.
    8. Fewell, Jason E. & Bergtold, Jason S. & Williams, Jeffery R., 2016. "Farmers' willingness to contract switchgrass as a cellulosic bioenergy crop in Kansas," Energy Economics, Elsevier, vol. 55(C), pages 292-302.
    9. 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.
    10. Bergtold, Jason S. & Shanoyan, Aleksan & Fewell, Jason E. & Williams, Jeffery R., 2017. "Annual bioenergy crops for biofuels production: Farmers' contractual preferences for producing sweet sorghum," Energy, Elsevier, vol. 119(C), pages 724-731.
    11. Thomas L. Morin & Roy E. Marsten, 1974. "Brand-and-Bound Strategies for Dynamic Programming," Discussion Papers 106, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    12. Baghersad, Milad & Emadikhiav, Mohsen & Huang, C. Derrick & Behara, Ravi S., 2023. "Modularity maximization to design contiguous policy zones for pandemic response," European Journal of Operational Research, Elsevier, vol. 304(1), pages 99-112.
    13. Hu, Xiaoxuan & Zhu, Waiming & Ma, Huawei & An, Bo & Zhi, Yanling & Wu, Yi, 2021. "Orientational variable-length strip covering problem: A branch-and-price-based algorithm," European Journal of Operational Research, Elsevier, vol. 289(1), pages 254-269.
    14. 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.
    15. Chao Zhang & Zihao Zhang & Mihai Cucuringu & Stefan Zohren, 2021. "A Universal End-to-End Approach to Portfolio Optimization via Deep Learning," Papers 2111.09170, arXiv.org.
    16. 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.
    17. Dusseault, Bernard & Pasquier, Philippe, 2021. "Usage of the net present value-at-risk to design ground-coupled heat pump systems under uncertain scenarios," Renewable Energy, Elsevier, vol. 173(C), pages 953-971.
    18. 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.
    19. 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.
    20. 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.

    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.