On the Convergence of Inexact Alternate Minimization in Problems with $$\ell _0$$ ℓ 0 Penalties
Matteo Lapucci () and
Alessio Sortino
Additional contact information
Matteo Lapucci: Università di Firenze
Alessio Sortino: Università di Firenze
SN Operations Research Forum, 2024, vol. 5, issue 2, 1-11
Abstract:
Abstract In this work, we consider unconstrained nonlinear optimization problems where the objective function presents a penalty term on the cardinality of a subset of the variables vector; specifically, we prove that an alternate minimization scheme has global asymptotic convergence guarantees towards points satisfying first-order optimality conditions, even when the optimization step with respect to one of the blocks of variables is inexact and without introducing proximal terms. This result, supported by numerical evidence, justifies the use of pure alternate minimization in applications, even in absence of convexity assumptions.
Keywords: Sparse optimization; Block coordinate descent; Global convergence; Optimality conditions; 90C26; 90C30 (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s43069-024-00323-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:snopef:v:5:y:2024:i:2:d:10.1007_s43069-024-00323-x
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/43069
DOI: 10.1007/s43069-024-00323-x
Access Statistics for this article
SN Operations Research Forum is currently edited by Marco Lübbecke
More articles in SN Operations Research Forum from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().