IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v91y2025i3d10.1007_s10898-024-01441-w.html
   My bibliography  Save this article

Iterative mix thresholding algorithm with continuation technique for mix sparse optimization and application

Author

Listed:
  • Yaohua Hu

    (Shenzhen University)

  • Jian Lu

    (Shenzhen University)

  • Xiaoqi Yang

    (The Hong Kong Polytechnic University, Kowloon)

  • Kai Zhang

    (Shenzhen University
    Guangdong University of Finance and Economics)

Abstract

Mix sparse structure is inherited in a wide class of practical applications, namely, the sparse structure appears as the inter-group and intra-group manners simultaneously. In this paper, we propose an iterative mix thresholding algorithm with continuation technique (IMTC) to solve the $$\ell _0$$ ℓ 0 regularized mix sparse optimization. The significant advantage of the IMTC is that it has a closed-form expression and low storage requirement, and it is able to promote the mix sparse structure of the solution. We prove the convergence property and the linear convergence rate of the ITMC to a local minimum; moreover, we show that the ITMC approaches an approximate true mix sparse solution within a tolerance relevant to the noise level under an assumption of restricted isometry property. We also apply the mix sparse optimization to model the differential optical absorption spectroscopy analysis with the wavelength misalignment, and numerical results indicate that the IMTC can exactly and quantitatively predict the existing materials and the factual wavelength misalignment simultaneously within 0.1 s, which meets the demand of improvement of the automatic analysis software.

Suggested Citation

  • Yaohua Hu & Jian Lu & Xiaoqi Yang & Kai Zhang, 2025. "Iterative mix thresholding algorithm with continuation technique for mix sparse optimization and application," Journal of Global Optimization, Springer, vol. 91(3), pages 511-534, March.
  • Handle: RePEc:spr:jglopt:v:91:y:2025:i:3:d:10.1007_s10898-024-01441-w
    DOI: 10.1007/s10898-024-01441-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-024-01441-w
    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/s10898-024-01441-w?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:jglopt:v:91:y:2025:i:3:d:10.1007_s10898-024-01441-w. 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.