IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v201y2024i1d10.1007_s10957-024-02381-x.html
   My bibliography  Save this article

Matrix Optimization Problem Involving Group Sparsity and Nonnegativity Constraints

Author

Listed:
  • Xi Zhang

    (Beijing Jiaotong University)

  • Xinrong Li

    (Northeastern University)

  • Chao Zhang

    (Beijing Jiaotong University)

Abstract

In this paper, we consider the matrix optimization problem with group sparsity and nonnegativity constraints. We analyze the optimality conditions and develop two matrix-based improved iterative hard thresholding algorithms for the problem, using the projected gradient method with the Armijo-type stepsize rule and the fixed stepsize, respectively. We then prove that the whole sequence generated by each of the proposed algorithm converges to a local minimizer of the optimization problem and establish the linear convergence rates as well as the iteration complexity results under mild conditions. Finally, numerical results are reported to demonstrate the usefulness of this type of problem and the efficiency of the proposed algorithms.

Suggested Citation

  • Xi Zhang & Xinrong Li & Chao Zhang, 2024. "Matrix Optimization Problem Involving Group Sparsity and Nonnegativity Constraints," Journal of Optimization Theory and Applications, Springer, vol. 201(1), pages 130-176, April.
  • Handle: RePEc:spr:joptap:v:201:y:2024:i:1:d:10.1007_s10957-024-02381-x
    DOI: 10.1007/s10957-024-02381-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-024-02381-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10957-024-02381-x?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:joptap:v:201:y:2024:i:1:d:10.1007_s10957-024-02381-x. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.