String-Averaging Incremental Subgradients for Constrained Convex Optimization with Applications to Reconstruction of Tomographic Images

Abstract

We present a method for non-smooth convex minimization which is based on subgradient directions and string-averaging techniques. In this approach, the set of available data is split into sequences (strings) and a given iterate is processed independently along each string, possibly in parallel, by an incremental subgradient method (ISM). The end-points of all strings are averaged to form the next iterate. The method is useful to solve sparse and large-scale non-smooth convex optimization problems, such as those arising in tomographic imaging. A convergence analysis is provided under realistic, standard conditions. Numerical tests are performed in a tomographic image reconstruction application, showing good performance for the convergence speed when measured as the decrease ratio of the objective function, in comparison to classical ISM.

References in corpus (7)

• Generalized Forward-Backward Splitting
• This is SPIRAL-TAP: Sparse Poisson Intensity Reconstruction ALgorithms - Theory and Practice
• A Proximal Decomposition Method for Solving Convex Variational Inverse Problems
• A Majorize-Minimize subspace approach for l2-l0 image regularization
• Convergence and Perturbation Resilience of Dynamic String-Averaging Projection Methods
• Stochastic Approximations and Perturbations in Forward-Backward Splitting for Monotone Operators
• String-Averaging Expectation-Maximization for Maximum Likelihood Estimation in Emission Tomography