DC-Programming versus ℓ0-Superiorization for Discrete Tomography
From MaRDI portal
Publication:5227893
DOI10.2478/auom-2018-0021zbMath1438.90269OpenAlexW2901342298MaRDI 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 tomographysuperiorizationsparse regularizationsplit convex feasibility problemDC-programming
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Iterative procedures involving nonlinear operators (47J25)
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