Christopher Hendrich
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Christopher Hendrich has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Radu Ioan Boţ
Faculty of Mathematics, University of Vienna, Vienna, Austria
12 shared publications - Ernö Robert Csetnek
Faculty of Mathematics, University of Vienna, Vienna, Austria
2 shared publications - André Heinrich
Chemnitz University of Technology
1 shared publication
Latest Publications
- Open Access
- 1 January 2016
- Published by American Institute of Mathematical Sciences (AIMS) in Inverse Problems and Imaging
- Vol. 10 (3) , 617-640
Solving monotone inclusions involving parallel sums of linearly composed maximally monotone operators
The aim of this article is to present two different primal-dual methods for solving structured monotone inclusions involving parallel sums of compositions of maximally monotone operators with linear bounded operators. By employing some elaborated splitting techniques, all of the operators occurring in the problem formulation are processed individually via forward or backward steps. The treatment of parallel sums of linearly composed maximally monotone operators is motivated by applications in imaging which involve first- and second-order total variation functionals, to which a special attention is given.
- 1 January 2016
- Published by American Institute of Mathematical Sciences (AIMS) in Inverse Problems and Imaging
- Vol. 10 (3) , 617-640
Open AccessSolving monotone inclusions involving parallel sums of linearly composed maximally monotone operators
The aim of this article is to present two different primal-dual methods for solving structured monotone inclusions involving parallel sums of compositions of maximally monotone operators with linear bounded operators. By employing some elaborated splitting techniques, all of the operators occurring in the problem formulation are processed individually via forward or backward steps. The treatment of parallel sums of linearly composed maximally monotone operators is motivated by applications in imaging which involve first- and second-order total variation functionals, to which a special attention is given.
- 9 October 2014
- Published by Springer Nature in Optimization Letters
- Vol. 9 (5) , 867-885
Convex risk minimization via proximal splitting methods
- 9 October 2014
- Published by Springer Nature in Optimization Letters
- Vol. 9 (5) , 867-885
Convex risk minimization via proximal splitting methods
- 6 August 2014
- Published by Springer Nature
- p. 57-99
Recent Developments on Primal–Dual Splitting Methods with Applications to Convex Minimization
- 6 August 2014
- Published by Springer Nature
- p. 57-99
Recent Developments on Primal–Dual Splitting Methods with Applications to Convex Minimization
- 3 May 2014
- Published by Springer Nature in TOP
- Vol. 23 (1) , 124-150
A variable smoothing algorithm for solving convex optimization problems
- 3 May 2014
- Published by Springer Nature in TOP
- Vol. 23 (1) , 124-150
A variable smoothing algorithm for solving convex optimization problems
- 26 February 2014
- Published by Springer Nature in Mathematical Programming
- Vol. 150 (2) , 251-279
On the convergence rate improvement of a primal-dual splitting algorithm for solving monotone inclusion problems
- 26 February 2014
- Published by Springer Nature in Mathematical Programming
- Vol. 150 (2) , 251-279
On the convergence rate improvement of a primal-dual splitting algorithm for solving monotone inclusion problems
- 7 January 2014
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 49 (3) , 551-568
Convergence Analysis for a Primal-Dual Monotone + Skew Splitting Algorithm with Applications to Total Variation Minimization
- 7 January 2014
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 49 (3) , 551-568
Convergence Analysis for a Primal-Dual Monotone + Skew Splitting Algorithm with Applications to Total Variation Minimization
- Open Access
Solving monotone inclusions involving parallel sums of linearly composed maximally monotone operators
The aim of this article is to present two different primal-dual methods for solving structured monotone inclusions involving parallel sums of compositions of maximally monotone operators with linear bounded operators. By employing some elaborated splitting techniques, all of the operators occurring in the problem formulation are processed individually via forward or backward steps. The treatment of parallel sums of linearly composed maximally monotone operators is motivated by applications in imaging which involve first- and second-order total variation functionals, to which a special attention is given.
Open AccessSolving monotone inclusions involving parallel sums of linearly composed maximally monotone operators
The aim of this article is to present two different primal-dual methods for solving structured monotone inclusions involving parallel sums of compositions of maximally monotone operators with linear bounded operators. By employing some elaborated splitting techniques, all of the operators occurring in the problem formulation are processed individually via forward or backward steps. The treatment of parallel sums of linearly composed maximally monotone operators is motivated by applications in imaging which involve first- and second-order total variation functionals, to which a special attention is given.
- 14 December 2012
- Published by Taylor & Francis in Optimization
- Vol. 64 (2) , 265-288
On the acceleration of the double smoothing technique for unconstrained convex optimization problems
In this article, we investigate the possibilities of accelerating the double smoothing (DS) technique when solving unconstrained nondifferentiable convex optimization problems. This approach relies on the regularization in two steps of the Fenchel dual problem associated with the problem to be solved into an optimization problem having a differentiable strongly convex objective function with Lipschitz continuous gradient. The doubly regularized dual problem is then solved via a fast gradient method. The aim of this article is to show how the properties of the functions in the objective of the primal problem influence the implementation of the DS approach and its rate of convergence. The theoretical results are applied to linear inverse problems by making use of different regularization functionals.
- 14 December 2012
- Published by Taylor & Francis in Optimization
- Vol. 64 (2) , 265-288
On the acceleration of the double smoothing technique for unconstrained convex optimization problems
In this article, we investigate the possibilities of accelerating the double smoothing (DS) technique when solving unconstrained nondifferentiable convex optimization problems. This approach relies on the regularization in two steps of the Fenchel dual problem associated with the problem to be solved into an optimization problem having a differentiable strongly convex objective function with Lipschitz continuous gradient. The doubly regularized dual problem is then solved via a fast gradient method. The aim of this article is to show how the properties of the functions in the objective of the primal problem influence the implementation of the DS approach and its rate of convergence. The theoretical results are applied to linear inverse problems by making use of different regularization functionals.
- 13 December 2012
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 54 (2) , 239-262
A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems
- 13 December 2012
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 54 (2) , 239-262
A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems
- Open Access
A variable smoothing algorithm for solving convex optimization problems
In this article we propose a method for solving unconstrained optimization problems with convex and Lipschitz continuous objective functions. By making use of the Moreau envelopes of the functions occurring in the objective, we smooth the latter to a convex and differentiable function with Lipschitz continuous gradient by using both variable and constant smoothing parameters. The resulting problem is solved via an accelerated first-order method and this allows us to recover approximately the optimal solutions to the initial optimization problem with a rate of convergence of order $\O(\tfrac{\ln k}{k})$ for variable smoothing and of order $\O(\tfrac{1}{k})$ for constant smoothing. Some numerical experiments employing the variable smoothing method in image processing and in supervised learning classification are also presented.Open AccessA variable smoothing algorithm for solving convex optimization problems
In this article we propose a method for solving unconstrained optimization problems with convex and Lipschitz continuous objective functions. By making use of the Moreau envelopes of the functions occurring in the objective, we smooth the latter to a convex and differentiable function with Lipschitz continuous gradient by using both variable and constant smoothing parameters. The resulting problem is solved via an accelerated first-order method and this allows us to recover approximately the optimal solutions to the initial optimization problem with a rate of convergence of order $\O(\tfrac{\ln k}{k})$ for variable smoothing and of order $\O(\tfrac{1}{k})$ for constant smoothing. Some numerical experiments employing the variable smoothing method in image processing and in supervised learning classification are also presented.