Additive Schwarz methods for convex optimization with backtracking
From MaRDI portal
Publication:2122660
DOI10.1016/j.camwa.2022.03.033zbMath1504.65129arXiv2110.07172OpenAlexW3207478911MaRDI QIDQ2122660
Publication date: 7 April 2022
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.07172
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Numerical optimization and variational techniques (65K10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Gradient methods for minimizing composite functions
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Fast first-order methods for composite convex optimization with backtracking
- A simplified view of first order methods for optimization
- Overlapping Schwarz preconditioners for isogeometric collocation methods
- Convergence analysis of generalized Schwarz algorithms for solving obstacle problems with \(T\)-monotone operator
- Rate of convergence for some constraint decomposition methods for nonlinear variational inequalities
- Overlapping additive Schwarz preconditioners for isogeometric collocation discretizations of linear elasticity
- Pseudo-linear convergence of an additive Schwarz method for dual total variation minimization
- An overlapping Schwarz method for virtual element discretizations in two dimensions
- KSPHPDDM and PCHPDDM: extending PETSc with advanced Krylov methods and robust multilevel overlapping Schwarz preconditioners
- Adaptive restart for accelerated gradient schemes
- One- and two-level Schwarz methods for variational inequalities of the second kind and their application to frictional contact
- Minimization of functions having Lipschitz continuous first partial derivatives
- Accelerated additive Schwarz methods for convex optimization with adaptive restart
- A simple nearly optimal restart scheme for speeding up first-order methods
- Global and uniform convergence of subspace correction methods for some convex optimization problems
- A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- Iterative Methods by Space Decomposition and Subspace Correction
- The method of alternating projections and the method of subspace corrections in Hilbert space
- Convergence Rate Analysis of a Multiplicative Schwarz Method for Variational Inequalities
- A Finite Element Approach for the Dual Rudin--Osher--Fatemi Model and Its Nonoverlapping Domain Decomposition Methods
- Fast Nonoverlapping Block Jacobi Method for the Dual Rudin--Osher--Fatemi Model
- Additive Schwarz Methods for Convex Optimization as Gradient Methods
- Convergence analysis of the Fast Subspace Descent method for convex optimization problems
- Sharpness, Restart, and Acceleration
- Backtracking Strategies for Accelerated Descent Methods with Smooth Composite Objectives
- Overlapping Domain Decomposition Methods for Total Variation Denoising
- Convergence Rate of Overlapping Domain Decomposition Methods for the Rudin--Osher--Fatemi Model Based on a Dual Formulation
- On the Convergence of Block Coordinate Descent Type Methods
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- A sharp convergence estimate for the method of subspace corrections for singular systems of equations
- Convergence Rate of a Schwarz Multilevel Method for the Constrained Minimization of Nonquadratic Functionals
- Accelerated Non-Overlapping Domain Decomposition Method for Total Variation Minimization
This page was built for publication: Additive Schwarz methods for convex optimization with backtracking
