Additive Schwarz Methods for Convex Optimization with Backtracking

Abstract

This paper presents a novel backtracking strategy for additive Schwarz methods for general convex optimization problems as an acceleration scheme. The proposed backtracking strategy is independent of local solvers, so that it can be applied to any algorithms that can be represented in an abstract framework of additive Schwarz methods. Allowing for adaptive increasing and decreasing of the step size along the iterations, the convergence rate of an algorithm is greatly improved. Improved convergence rate of the algorithm is proven rigorously. In addition, combining the proposed backtracking strategy with a momentum acceleration technique, we propose a further accelerated additive Schwarz method. Numerical results for various convex optimization problems that support our theory are presented.

20 pages, 3 figures

Cited by in corpus (5)

• Additive Schwarz methods for fourth-order variational inequalities
• A neuron-wise subspace correction method for the finite neuron method
• On the linear convergence of additive Schwarz methods for the $p$-Laplacian
• Additive Schwarz methods for semilinear elliptic problems with convex energy functionals: Convergence rate independent of nonlinearity
• Parallel subspace correction methods for semicoercive and nearly semicoercive convex optimization with applications to nonlinear PDEs