An extrapolated iteratively reweighted $$\ell _1$$ ℓ 1 method with complexity analysis
Hao Wang (),
Hao Zeng () and
Jiashan Wang ()
Additional contact information
Hao Wang: ShanghaiTech University
Hao Zeng: ShanghaiTech University
Jiashan Wang: University of Washington
Computational Optimization and Applications, 2022, vol. 83, issue 3, No 8, 967-997
Abstract:
Abstract The iteratively reweighted $$\ell _1$$ ℓ 1 algorithm is a widely used method for solving various regularization problems, which generally minimize a differentiable loss function combined with a convex/nonconvex regularizer to induce sparsity in the solution. However, the convergence and the complexity of iteratively reweighted $$\ell _1$$ ℓ 1 algorithms is generally difficult to analyze, especially for non-Lipschitz differentiable regularizers such as $$\ell _p$$ ℓ p norm regularization with $$0
Keywords: $$\ell _p$$ ℓ p regularization; Extrapolation techniques; Iteratively reweighted methods; Kurdyka-Łojasiewicz; Non-Lipschitz regularization (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s10589-022-00416-5 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:coopap:v:83:y:2022:i:3:d:10.1007_s10589-022-00416-5
Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589
DOI: 10.1007/s10589-022-00416-5
Access Statistics for this article
Computational Optimization and Applications is currently edited by William W. Hager
More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().