Sparse Regularization With Reverse Sorted Sum of Squares via an Unrolled Difference-of-Convex Approach
This paper proposes a sparse regularization method with a novel sorted regularization function. Sparse regularization is commonly used to solve underdetermined inverse problems. Traditional sparse regularization functions, such as <inline-formula><tex-math notation="LaTeX">$L_{...
Saved in:
Main Authors: | Takayuki Sasaki, Kazuya Hayase, Masaki Kitahara, Shunsuke Ono |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2025-01-01
|
Series: | IEEE Open Journal of Signal Processing |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10840312/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Radius problems for a subclass of close-to-convex univalent functions
by: Khalida Inayat Noor
Published: (1992-01-01) -
Research and evaluation of sparse array for massive MIMO
by: Mengting LOU, et al.
Published: (2021-09-01) -
Subordination by convex functions
by: Ram Singh, et al.
Published: (2000-01-01) -
Convex pillar paintings in church interiors: context, materials and conservation problems
by: Sven Van Dorst
Published: (2013-05-01) -
Convexity preserving summability matrices
by: C. R. Selvaraj
Published: (1990-01-01)