DC-Programming versus ℓ0-Superiorization for Discrete Tomography
In this paper we focus on the reconstruction of sparse solutions to underdetermined systems of linear equations with variable bounds. The problem is motivated by sparse and gradient-sparse reconstruction in binary and discrete tomography from limited data. To address the ℓ0-minimization problem we c...
Main Authors: | Gibali Aviv, Petra Stefania |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2018-07-01
|
Series: | Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica |
Subjects: | |
Online Access: | https://doi.org/10.2478/auom-2018-0021 |
Similar Items
-
Non-Convex Split Feasibility Problems: Models, Algorithms and Theory
by: Gibali, Aviv, et al.
Published: (2020-10-01) -
Feasibility-based fixed point networks
by: Howard Heaton, et al.
Published: (2021-11-01) -
Image Deblurring Based on Convex Non-Convex Sparse Regularization and Plug-and-Play Algorithm
by: Yi Wang, et al.
Published: (2023-12-01) -
A new fixed-time stability of neural network to solve split convex feasibility problems
by: Jinlan Zheng, et al.
Published: (2023-10-01) -
Difference of two norms-regularizations for Q-Lasso
by: Abdellatif Moudafi
Published: (2021-01-01)