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

A Designed Thresholding Operator for Low-Rank Matrix Completion

Author

Listed:
  • Angang Cui

    (School of Mathematics and Statistics, Yulin University, Yulin 719000, China)

  • Haizhen He

    (School of International Education, Yulin University, Yulin 719000, China)

  • Hong Yang

    (School of Mathematics and Statistics, Yulin University, Yulin 719000, China)

Abstract

In this paper, a new thresholding operator, namely, designed thresholding operator, is designed to recover the low-rank matrices. With the change of parameter in designed thresholding operator, the designed thresholding operator can apply less bias to the larger singular values of a matrix compared with the classical soft thresholding operator. Based on the designed thresholding operator, an iterative thresholding algorithm for recovering the low-rank matrices is proposed. Numerical experiments on some image inpainting problems show that the proposed thresholding algorithm performs effectively in recovering the low-rank matrices.

Suggested Citation

  • Angang Cui & Haizhen He & Hong Yang, 2024. "A Designed Thresholding Operator for Low-Rank Matrix Completion," Mathematics, MDPI, vol. 12(7), pages 1-13, April.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:7:p:1065-:d:1368815
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/7/1065/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/7/1065/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Dingtao Peng & Naihua Xiu & Jian Yu, 2017. "$$S_{1/2}$$ S 1 / 2 regularization methods and fixed point algorithms for affine rank minimization problems," Computational Optimization and Applications, Springer, vol. 67(3), pages 543-569, July.
    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.

      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:12:y:2024:i:7:p:1065-:d:1368815. 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: 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.