DC-Programming versus \ell₀-superiorization for discrete tomography

DOI10.2478/AUOM-2018-0021MaRDI QIDQ5227893zbMATH OpenOpenAlexFDO

Authors Aviv Gibali, Stefania Petra

Publication date 7 August 2019

Published in Analele Universitatii "Ovidius" Constanta - Seria Matematica (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.2478/auom-2018-0021

zbMATH Keywords

discrete tomographysparse regularizationsuperiorizationsplit convex feasibility problemDC-programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Iterative procedures involving nonlinear operators (47J25)

Recommendations

• Discrete tomography by convex--concave regularization and D.C. programming
• Variational reconstruction with DC-programming
• DC approximation approach for \(\ell_0\)-minimization in compressed sensing
• Superiorization of incremental optimization algorithms for statistical tomographic image reconstruction
• Discrete tomography by convex-concave regularization using linear und quadratic optimization.

Cited in

(5)

• A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
• Derivative-free superiorization with component-wise perturbations
• Approaches to iterative algorithms for solving nonlinear equations with an application in tomographic absorption spectroscopy
• An explicit algorithm for solving monotone variational inequalities
• Inertial accelerated steepest descent algorithm for generalized split common fixed point problems

This page was built for publication: DC-Programming versus $\ell_0$-superiorization for discrete tomography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5227893)