Alternating proximal algorithms for linearly constrained variational inequalities: application to domain decomposition for PDE's
DOI10.1016/j.na.2011.07.066zbMath1228.65100OpenAlexW1978435907MaRDI QIDQ642609
Alexandre Cabot, Pierre Frankel, Hedy Attouch, Juan Peypouquet
Publication date: 27 October 2011
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/130767
maximal monotone operatorsvariational inequalitiesdomain decomposition methodsconvex minimizationproximal algorithmmonotone inclusions
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Convex programming (90C25) Variational inequalities (49J40) Numerical methods based on nonlinear programming (49M37) Numerical methods for variational inequalities and related problems (65K15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The asymptotic behavior of the composition of two resolvents
- Asymptotic almost-equivalence of Lipschitz evolution systems in Banach spaces
- The trace of Sobolev-Slobodeckij spaces on Lipschitz domains
- Penalty-proximal methods in convex programming
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- Produits infinis de resolvantes
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- Asymptotic control and stabilization of nonlinear oscillators with non-isolated equilibria
- Primal and dual convergence of a proximal point exponential penalty method for linear programming
- Asymptotic behavior of coupled dynamical systems with multiscale aspects
- Prox-Penalization and Splitting Methods for Constrained Variational Problems
- Alternating proximal algorithms with asymptotically vanishing coupling. Application to domain decomposition for PDE's
- Estimates near the boundary for solutions of elliptic partial differential equations satisfying general boundary conditions. I
- Variational Analysis in Sobolev andBVSpaces
- A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move
- Convergence d'un schéma de minimisation alternée
- Monotone Operators and the Proximal Point Algorithm
- Elliptic Partial Differential Equations of Second Order
- Variational Analysis
- Numerical methods for nondifferentiable convex optimization
- Coupling General Penalty Schemes for Convex Programming with the Steepest Descent and the Proximal Point Algorithm
- Proximal Point Algorithm Controlled by a Slowly Vanishing Term: Applications to Hierarchical Minimization
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- Estimates near the boundary for solutions of elliptic partial differential equations satisfying general boundary conditions II
- A convergence result for nonautonomous subgradient evolution equations and its application to the steepest descent exponential penalty trajectory in linear programming
This page was built for publication: Alternating proximal algorithms for linearly constrained variational inequalities: application to domain decomposition for PDE's