Convergence rate analysis of an asynchronous space decomposition method for convex Minimization
From MaRDI portal
Banach spaceconvergence rateconvex minimizationdomain decompositionmultigridnonlinear network flowobstacle problemrelaxation methodsspace decomposition
Boundary value problems for second-order elliptic equations (35J25) Existence theories for optimal control problems involving partial differential equations (49J20) Decomposition methods (49M27) Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Convex programming (90C25) Programming in abstract spaces (90C48)
Recommendations
- On the convergence rate of a space decomposition method
- Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
- Convergence Analysis of Dual Decomposition Algorithm in Distributed Optimization: Asynchrony and Inexactness
- On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm
- Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization
- On the convergence of asynchronous parallel algorithm for large-scale linearly constrained minimization problem
- On the convergence of asynchronous parallel algorithm for large-scale linearly constrained minimization problem
- Parallel synchronous and asynchronous space-decomposition algorithms for large-scale minimization problems
- On the convergence analysis of asynchronous SGD for solving consistent linear systems
- Convergence of some asynchronous nonlinear multisplitting methods
Cites work
- A multilevel iterative method for symmetric, positive definite linear complementarity problems
- A Novel Two-Grid Method for Semilinear Elliptic Equations
- A Unified Analysis of Hoffman’s Bound via Fenchel Duality
- Adaptive Multilevel Methods for Obstacle Problems
- An additive Schwarz method for variational inequalities
- Analysis of a damped nonlinear multilevel method
- Analysis of a Multilevel Iterative Method for Nonlinear Finite Element Equations
- 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
- Asynchronous weighted additive Schwarz methods
- Chaotic relaxation
- Convergence Estimates for Product Iterative Methods with Applications to Domain Decomposition
- Convex Analysis
- Error bounds and convergence analysis of feasible descent methods: A general approach
- scientific article; zbMATH DE number 437394 (Why is no real title available?)
- scientific article; zbMATH DE number 4049432 (Why is no real title available?)
- scientific article; zbMATH DE number 45081 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 3596197 (Why is no real title available?)
- scientific article; zbMATH DE number 1313105 (Why is no real title available?)
- scientific article; zbMATH DE number 626231 (Why is no real title available?)
- scientific article; zbMATH DE number 671790 (Why is no real title available?)
- scientific article; zbMATH DE number 697862 (Why is no real title available?)
- scientific article; zbMATH DE number 736350 (Why is no real title available?)
- scientific article; zbMATH DE number 218047 (Why is no real title available?)
- scientific article; zbMATH DE number 949303 (Why is no real title available?)
- Iterative Methods by Space Decomposition and Subspace Correction
- Linear and quasilinear elliptic equations
- Monotone multigrid methods for elliptic variational inequalities. II
- Multi-grid solutions to the elastic plastic torsion problem in multiply connected domains
- Multi-Level Adaptive Solutions to Boundary-Value Problems
- Multigrid Algorithms for the Solution of Linear Complementarity Problems Arising from Free Boundary Problems
- On Monotone and Geometric Convergence of Schwarz Methods for Two-Sided Obstacle Problems
- On multi-grid methods for variational inequalities
- On multilevel iterative methods for optimization problems
- On numerical solution of elliptic problems of the order 2m by least squares method using splines on rectangular grids
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- On the nonlinear domain decomposition method
- On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm
- Parallel Multilevel Preconditioners
- Partially Asynchronous, Parallel Algorithms for Network Flow and Other Problems
- PLTMGC: A Multigrid Continuation Program for Parameterized Nonlinear Elliptic Systems
- Rate of Convergence of Some Space Decomposition Methods for Linear and Nonlinear Problems
- Some aspects of parallel and distributed iterative algorithms - a survey
- The Construction of Preconditioners for Elliptic Problems by Substructuring, IV
- Two-Grid Discretization Techniques for Linear and Nonlinear PDE<scp>s</scp>
- Two-sided approximations for unilateral variational inequalities by multi-grid methods
Cited in
(23)- Additive Schwarz preconditioners for the obstacle problem of clamped Kirchhoff plates
- Block monotone iterative methods for elliptic variational inequalities.
- On the convergence rate of a space decomposition method
- A note on domain decomposition approaches for solving 3D variational data assimilation models
- Discrete orthogonal decomposition and variational fluid flow estimation
- A nonlinear multigrid method for total variation minimization from image restoration
- Non-overlapping domain decomposition methods for dual total variation based image denoising
- Domain decomposition method for image deblurring
- Parallel solution of American option derivatives on GPU clusters
- ARock: an algorithmic framework for asynchronous parallel coordinate updates
- Greedy and randomized versions of the multiplicative Schwarz method
- Domain decomposition methods for nonlocal total variation image restoration
- An asynchronous inertial algorithm for solving convex feasibility problems with strict pseudo-contractions in Hilbert spaces
- 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
- Additive Schwarz preconditioners for C0 interior penalty methods for the obstacle problem of clamped Kirchhoff plates
- A full approximation scheme multilevel method for nonlinear variational inequalities
- Asynchronous global-local non-invasive coupling for nonlinear monotone patches: application to plasticity problems
- Domain decomposition for non-smooth (in particular TV) minimization
- A convergent overlapping domain decomposition method for total variation minimization
- On the convergence of generalized Schwarz algorithms for solving obstacle problems with elliptic operators
- Block monotone iterative algorithms for variational inequalities with nonlinear operators
- A shape and topology optimization technique for solving a class of linear complementarity problems in function space
This page was built for publication: Convergence rate analysis of an asynchronous space decomposition method for convex Minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4529709)
