IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i12p2744-d1173092.html
   My bibliography  Save this article

Heavy-Ball-Based Hard Thresholding Pursuit for Sparse Phase Retrieval Problems

Author

Listed:
  • Yingying Li

    (School of Mathematics and Statistics, Shandong University of Technology, Zibo 255000, China)

  • Jinchuan Zhou

    (School of Mathematics and Statistics, Shandong University of Technology, Zibo 255000, China)

  • Zhongfeng Sun

    (School of Mathematics and Statistics, Shandong University of Technology, Zibo 255000, China)

  • Jingyong Tang

    (School of Mathematics and Statistics, Xinyang Normal University, Xinyang 464000, China)

Abstract

We introduce a novel iterative algorithm, termed the Heavy-Ball-Based Hard Thresholding Pursuit for sparse phase retrieval problem (SPR-HBHTP), to reconstruct a sparse signal from a small number of magnitude-only measurements. Our algorithm is obtained via a natural combination of the Hard Thresholding Pursuit for sparse phase retrieval (SPR-HTP) and the classical Heavy-Ball (HB) acceleration method. The robustness and convergence for the proposed algorithm were established with the help of the restricted isometry property. Furthermore, we prove that our algorithm can exactly recover a sparse signal with overwhelming probability in finite steps whenever the initialization is in the neighborhood of the underlying sparse signal, provided that the measurement is accurate. Extensive numerical tests show that SPR-HBHTP has a markedly improved recovery performance and runtime compared to existing alternatives, such as the Hard Thresholding Pursuit for sparse phase retrieval problem (SPR-HTP), the SPARse Truncated Amplitude Flow (SPARTA), and Compressive Phase Retrieval with Alternating Minimization (CoPRAM).

Suggested Citation

  • Yingying Li & Jinchuan Zhou & Zhongfeng Sun & Jingyong Tang, 2023. "Heavy-Ball-Based Hard Thresholding Pursuit for Sparse Phase Retrieval Problems," Mathematics, MDPI, vol. 11(12), pages 1-24, June.
  • Handle: RePEc:gam:jmathe:v:11:y:2023:i:12:p:2744-:d:1173092
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/12/2744/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/11/12/2744/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:11:y:2023:i:12:p:2744-:d:1173092. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.