DC-Programming versus ℓ0-Superiorization for Discrete Tomography
From MaRDI portal
Publication:5227893
DOI10.2478/auom-2018-0021zbMath1438.90269MaRDI QIDQ5227893
Publication date: 7 August 2019
Published in: Analele Universitatii "Ovidius" Constanta - Seria Matematica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/auom-2018-0021
discrete tomography; superiorization; sparse regularization; split convex feasibility problem; DC-programming
65K05: Numerical mathematical programming methods
90C90: Applications of mathematical programming
90C26: Nonconvex programming, global optimization
47J25: Iterative procedures involving nonlinear operators
Related Items
Inertial accelerated steepest descent algorithm for generalized split common fixed point problems, Derivative-free superiorization with component-wise perturbations, An explicit algorithm for solving monotone variational inequalities, A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications