Additive Schwarz methods for convex optimization as gradient methods
From MaRDI portal
Abstract: This paper gives a unified convergence analysis of additive Schwarz methods for general convex optimization problems. Resembling to the fact that additive Schwarz methods for linear problems are preconditioned Richardson methods, we prove that additive Schwarz methods for general convex optimization are in fact gradient methods. Then an abstract framework for convergence analysis of additive Schwarz methods is proposed. The proposed framework applied to linear elliptic problems agrees with the classical theory. We present applications of the proposed framework to various interesting convex optimization problems such as nonlinear elliptic problems, nonsmooth problems, and nonsharp problems.
Recommendations
- Accelerated additive Schwarz methods for convex optimization with adaptive restart
- Additive Schwarz methods for convex optimization with backtracking
- An additive analysis of multiplicative Schwarz methods
- An additive Schwarz analysis for multiplicative Schwarz methods: general case
- Complete, Optimal and Optimized Coarse Spaces for Additive Schwarz
Cites work
- A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
- A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A finite element nonoverlapping domain decomposition method with Lagrange multipliers for the dual total variation minimizations
- Accelerated, parallel, and proximal coordinate descent
- An \(L^1\) penalty method for general obstacle problems
- An additive Schwarz method for variational inequalities
- An algebraic convergence theory for restricted additive Schwarz methods using weighted max norms
- An algorithm for splitting parallel sums of linearly composed monotone operators, with applications to signal recovery
- An introduction to continuous optimization for imaging
- An overlapping Schwarz algorithm for Raviart-Thomas vector fields with discontinuous coefficients
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Convergence Rate Analysis of a Multiplicative Schwarz Method for Variational Inequalities
- Convergence Rate of a Schwarz Multilevel Method for the Constrained Minimization of Nonquadratic Functionals
- Convergence rate of overlapping domain decomposition methods for the Rudin-Osher-Fatemi model based on a dual formulation
- Convex analysis and monotone operator theory in Hilbert spaces
- Discrete total variation with finite elements and applications to imaging
- Fast nonoverlapping block Jacobi method for the dual Rudin-Osher-Fatemi model
- Global and uniform convergence of subspace correction methods for some convex optimization problems
- Gradient methods for minimizing composite functions
- scientific article; zbMATH DE number 2113718 (Why is no real title available?)
- Iterative Methods by Space Decomposition and Subspace Correction
- On the abstract theory of additive and multiplicative Schwarz algorithms
- On the convergence of alternating minimization for convex programming with applications to iteratively reweighted least squares and decomposition schemes
- On the convergence of block coordinate descent type methods
- One- and two-level Schwarz methods for variational inequalities of the second kind and their application to frictional contact
- Preconditioned descent algorithms for \(p\)-Laplacian
- Primal domain decomposition methods for the total variation minimization, based on dual decomposition
- Rate of convergence for some constraint decomposition methods for nonlinear variational inequalities
- Rate of Convergence of Some Space Decomposition Methods for Linear and Nonlinear Problems
- The finite element methods for elliptic problems.
- The method of alternating projections and the method of subspace corrections in Hilbert space
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Total Bounded Variation Regularization as a Bilaterally Constrained Optimization Problem
Cited in
(20)- Pseudo-linear convergence of an additive Schwarz method for dual total variation minimization
- Additive Schwarz methods for convex optimization with backtracking
- Additive Schwarz algorithm for the nonlinear complementarity problem with \(M\)-function
- Accelerated additive Schwarz methods for convex optimization with adaptive restart
- Fast gradient methods for uniformly convex and weakly smooth problems
- Preconditioning for finite element methods with strain smoothing
- Additive Schwarz with Variable Weights
- Convergence analysis of the fast subspace descent method for convex optimization problems
- An additive Schwarz analysis for multiplicative Schwarz methods: general case
- Additive Schwarz methods for semilinear elliptic problems with convex energy functionals: convergence rate independent of nonlinearity
- A dual-primal finite element tearing and interconnecting method for nonlinear variational inequalities utilizing linear local problems
- Iterative algorithms for partitioned neural network approximation to partial differential equations
- Domain decomposition algorithms for physics-informed neural networks
- Additive Schwarz methods for convex optimization -- convergence theory and acceleration
- Additive Schwarz methods for fourth-order variational inequalities
- Two-level overlapping Schwarz preconditioners with universal coarse spaces for 2mth-order elliptic problems
- On the linear convergence of additive Schwarz methods for the p-Laplacian
- A nonoverlapping domain decomposition method for extreme learning machines: elliptic problems
- A general decomposition method for a convex problem related to total variation minimization
- Randomized subspace correction methods for convex optimization
This page was built for publication: Additive Schwarz methods for convex optimization as gradient methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5110553)
