Convergence rate analysis of an asynchronous space decomposition method for convex Minimization
From MaRDI portal
Publication:4529709
DOI10.1090/S0025-5718-01-01344-8zbMath0997.65088MaRDI QIDQ4529709
Publication date: 6 May 2002
Published in: Mathematics of Computation (Search for Journal in Brave)
domain decompositionBanach spaceconvergence ratemultigridobstacle problemconvex minimizationrelaxation methodsspace decompositionnonlinear network flow
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical optimization and variational techniques (65K10) Boundary value problems for second-order elliptic equations (35J25) Programming in abstract spaces (90C48) Decomposition methods (49M27) Existence theories for optimal control problems involving partial differential equations (49J20)
Related Items
Parallel solution of American option derivatives on GPU clusters, Discrete orthogonal decomposition and variational fluid flow estimation, An asynchronous inertial algorithm for solving convex feasibility problems with strict pseudo-contractions in Hilbert spaces, Additive Schwarz preconditioners for C0 interior penalty methods for the obstacle problem of clamped Kirchhoff plates, Greedy and randomized versions of the multiplicative Schwarz method, Additive Schwarz preconditioners for the obstacle problem of clamped Kirchhoff plates, On the convergence of generalized Schwarz algorithms for solving obstacle problems with elliptic operators, Domain decomposition methods for nonlocal total variation image restoration, A nonlinear multigrid method for total variation minimization from image restoration, Block monotone iterative algorithms for variational inequalities with nonlinear operators, A convergent overlapping domain decomposition method for total variation minimization, A shape and topology optimization technique for solving a class of linear complementarity problems in function space, A note on domain decomposition approaches for solving 3D variational data assimilation models, Non-overlapping domain decomposition methods for dual total variation based image denoising, Domain decomposition method for image deblurring, ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates, 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, Block monotone iterative methods for elliptic variational inequalities.
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A multilevel iterative method for symmetric, positive definite linear complementarity problems
- Some aspects of parallel and distributed iterative algorithms - a survey
- Analysis of a damped nonlinear multilevel method
- On multi-grid methods for variational inequalities
- Asynchronous multilevel adaptive methods for solving partial differential equations on multiprocessors: Basic ideas
- Asynchronous multilevel adaptive methods for solving partial differential equations on multiprocessors: Performance results
- Error bounds and convergence analysis of feasible descent methods: A general approach
- On the nonlinear domain decomposition method
- Asynchronous weighted additive Schwarz methods
- On multilevel iterative methods for optimization problems
- Monotone multigrid methods for elliptic variational inequalities. II
- Linear and quasilinear elliptic equations
- Chaotic relaxation
- Multigrid Algorithms for the Solution of Linear Complementarity Problems Arising from Free Boundary Problems
- Parallel Multilevel Preconditioners
- Multi-grid solutions to the elastic plastic torsion problem in multiply connected domains
- PLTMGC: A Multigrid Continuation Program for Parameterized Nonlinear Elliptic Systems
- Two-sided approximations for unilateral variational inequalities by multi-grid methods
- The Construction of Preconditioners for Elliptic Problems by Substructuring, IV
- Analysis of a Multilevel Iterative Method for Nonlinear Finite Element Equations
- Convergence Estimates for Product Iterative Methods with Applications to Domain Decomposition
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm
- Iterative Methods by Space Decomposition and Subspace Correction
- Multi-Level Adaptive Solutions to Boundary-Value Problems
- Rate of Convergence of Some Space Decomposition Methods for Linear and Nonlinear Problems
- A Novel Two-Grid Method for Semilinear Elliptic Equations
- Adaptive Multilevel Methods for Obstacle Problems
- On Monotone and Geometric Convergence of Schwarz Methods for Two-Sided Obstacle Problems
- An additive Schwarz method for variational inequalities
- Two-Grid Discretization Techniques for Linear and Nonlinear PDE<scp>s</scp>
- A Unified Analysis of Hoffman’s Bound via Fenchel Duality
- Partially Asynchronous, Parallel Algorithms for Network Flow and Other Problems
- Convex Analysis
