A Generalization of the Chambolle-Pock Algorithm to Banach Spaces with Applications to Inverse Problems

Abstract

For a Hilbert space setting Chambolle and Pock introduced an attractive first-order algorithm which solves a convex optimization problem and its Fenchel dual simultaneously. We present a generalization of this algorithm to Banach spaces. Moreover, under certain conditions we prove strong convergence as well as convergence rates. Due to the generalization the method becomes efficiently applicable for a wider class of problems. This fact makes it particularly interesting for solving ill-posed inverse problems on Banach spaces by Tikhonov regularization or the iteratively regularized Newton-type method, respectively.

References in corpus (5)

• Generalized Projection Operators in Banach Spaces: Properties and Applications
• Iteratively regularized Newton-type methods for general data misfit functionals and applications to Poisson data
• Convergence rates in expectation for Tikhonov-type regularization of Inverse Problems with Poisson data
• General Resolvents for Monotone Operators: Characterization and Extension
• On the convergence rate improvement of a primal-dual splitting algorithm for solving monotone inclusion problems

Cited by in corpus (4)

• Testing and non-linear preconditioning of the proximal point method
• First-order primal-dual methods for nonsmooth nonconvex optimisation
• Diffusion tensor imaging with deterministic error bounds
• Efficient and robust high-dimensional sparse logistic regression via nonlinear primal-dual hybrid gradient algorithms