DC-Programming versus ℓ0-Superiorization for Discrete Tomography

Abstract 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 consider two approaches: DC-programming and ℓ0-superiorization. We show that ℓ0-minimization over bounded polyhedra can be equivalently formulated as a DC program. Unfortunately, standard DC algorithms based on convex programming often get trapped in local minima. On the other hand, ℓ0-superiorization yields comparable results at significantly lower costs.

[1]  G. Herman,et al.  Algebraic reconstruction techniques (ART) for three-dimensional electron microscopy and x-ray photography. , 1970, Journal of theoretical biology.

[2]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[3]  J. Toland.  Duality in nonconvex optimization , 1978 .

[4]  Yair Censor,et al.  Cyclic subgradient projections , 1982, Math. Program..

[5]  S. Reich,et al.  Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings , 1984 .

[6]  El Bernoussi Souad,et al.  Algorithms for Solving a Class of Nonconvex Optimization Problems. Methods of Subgradients , 1986 .

[7]  Y. Censor,et al.  On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning , 1988 .

[8]  Balas K. Natarajan,et al.  Sparse Approximate Solutions to Linear Systems , 1995, SIAM J. Comput..

[9]  Olvi L. Mangasarian,et al.  Machine Learning via Polyhedral Concave Minimization , 1996 .

[10]  W. Floyd,et al.  HYPERBOLIC GEOMETRY , 1996 .

[11]  T. P. Dinh,et al.  Convex analysis approach to d.c. programming: Theory, Algorithm and Applications , 1997 .

[12]  Y. Censor,et al.  Parallel Optimization: Theory, Algorithms, and Applications , 1997 .

[13]  Y. Censor,et al.  Parallel Optimization:theory , 1997 .

[14]  Le Thi Hoai An,et al.  A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem , 1998, SIAM J. Optim..

[15]  R. Horst,et al.  DC Programming: Overview , 1999 .

[16]  C. Byrne.  Iterative projection onto convex sets using multiple Bregman distances , 1999 .

[17]  Yair Censor,et al.  Averaging Strings of Sequential Iterations for Convex Feasibility Problems , 2001 .

[18]  Yair Censor,et al.  A multiprojection algorithm using Bregman projections in a product space , 1994, Numerical Algorithms.

[19]  Le Thi Hoai An,et al.  The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization Problems , 2005, Ann. Oper. Res..

[20]  Y. Censor,et al.  A unified approach for inversion problems in intensity-modulated radiation therapy , 2006, Physics in medicine and biology.

[21]  Kees Joost Batenburg.  A Network Flow Algorithm for Reconstructing Binary Images from Discrete X-rays , 2006, Journal of Mathematical Imaging and Vision.

[22]  G. Herman,et al.  Advances in Discrete Tomography and Its Applications (Applied and Numerical Harmonic Analysis) , 2007 .

[23]  R. Chartrand,et al.  Restricted isometry properties and nonconvex compressive sensing , 2007 .

[24]  D. Butnariu,et al.  Stable Convergence Behavior Under Summable Perturbations of a Class of Projection Methods for Convex Feasibility and Optimization Problems , 2007, IEEE Journal of Selected Topics in Signal Processing.

[25]  A. Bagirov,et al.  Discrete Gradient Method: Derivative-Free Method for Nonsmooth Optimization , 2008 .

[26]  Ran Davidi,et al.  Perturbation resilience and superiorization of iterative algorithms , 2010, Inverse problems.

[27]  Glenn Fung,et al.  Equivalence of Minimal ℓ0- and ℓp-Norm Solutions of Linear Equalities, Inequalities and Linear Programs for Sufficiently Small p , 2011, J. Optim. Theory Appl..

[28]  A. Cegielski.  Iterative Methods for Fixed Point Problems in Hilbert Spaces , 2012 .

[29]  Per Christian Hansen,et al.  AIR Tools - A MATLAB package of algebraic iterative reconstruction methods , 2012, J. Comput. Appl. Math..

[30]  Holger Rauhut,et al.  A Mathematical Introduction to Compressive Sensing , 2013, Applied and Numerical Harmonic Analysis.

[31]  Yair Censor,et al.  Convergence and perturbation resilience of dynamic string-averaging projection methods , 2012, Computational Optimization and Applications.

[32]  Yair Censor,et al.  Weak and Strong Superiorization: Between Feasibility-Seeking and Minimization , 2014, 1410.0130.

[33]  Gabor T. Herman,et al.  Superiorization for Image Analysis , 2014, IWCIA.

[34]  Ran Davidi,et al.  Projected Subgradient Minimization Versus Superiorization , 2013, Journal of Optimization Theory and Applications.

[35]  Yair Censor,et al.  Superiorization and Perturbation Resilience of Algorithms: A Continuously Updated Bibliography , 2015, 1506.04219.

[36]  Alvaro R. De Pierro,et al.  A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors , 2015, ArXiv.

[37]  Jack Xin,et al.  Minimization of ℓ1-2 for Compressed Sensing , 2015, SIAM J. Sci. Comput..

[38]  Yair Censor,et al.  Strict Fejér Monotonicity by Superiorization of Feasibility-Seeking Projection Methods , 2014, J. Optim. Theory Appl..

[39]  Yair Censor,et al.  Sparsity constrained split feasibility for dose-volume constraints in inverse planning of intensity-modulated photon or proton therapy , 2017, Physics in medicine and biology.

[40]  Ming Jiang,et al.  Superiorization: theory and applications , 2017 .