IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v90y2025i1d10.1007_s10589-024-00625-0.html
   My bibliography  Save this article

The sparse(st) optimization problem: reformulations, optimality, stationarity, and numerical results

Author

Listed:
  • Christian Kanzow

    (University of Würzburg)

  • Alexandra Schwartz

    (Technical University of Dresden)

  • Felix Weiß

    (University of Würzburg)

Abstract

We consider the sparse optimization problem with nonlinear constraints and an objective function, which is given by the sum of a general smooth mapping and an additional term defined by the $$ \ell _0 $$ ℓ 0 -quasi-norm. This term is used to obtain sparse solutions, but difficult to handle due to its nonconvexity and nonsmoothness (the sparsity-improving term is even discontinuous). The aim of this paper is to present two reformulations of this program as a smooth nonlinear program with complementarity-type constraints. We show that these programs are equivalent in terms of local and global minima and introduce a problem-tailored stationarity concept, which turns out to coincide with the standard KKT conditions of the two reformulated problems. In addition, a suitable constraint qualification as well as second-order conditions for the sparse optimization problem are investigated. These are then used to show that three Lagrange–Newton-type methods are locally fast convergent. Numerical results on different classes of test problems indicate that these methods can be used to drastically improve sparse solutions obtained by some other (globally convergent) methods for sparse optimization problems.

Suggested Citation

  • Christian Kanzow & Alexandra Schwartz & Felix Weiß, 2025. "The sparse(st) optimization problem: reformulations, optimality, stationarity, and numerical results," Computational Optimization and Applications, Springer, vol. 90(1), pages 77-112, January.
    • Handle: RePEc:spr:coopap:v:90:y:2025:i:1:d:10.1007_s10589-024-00625-0
    DOI: 10.1007/s10589-024-00625-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-024-00625-0
    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/s10589-024-00625-0?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:coopap:v:90:y:2025:i:1:d:10.1007_s10589-024-00625-0. 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.