Alternating proximal algorithms with asymptotically vanishing coupling. Application to domain decomposition for PDE's

DOI10.1080/02331934.2010.511672zbMath1238.65051OpenAlexW2093418273MaRDI QIDQ3225086

Alexandre Cabot, Pierre Frankel

Publication date: 15 March 2012

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2010.511672

zbMATH Keywords

weak convergencedomain decompositionconvex minimizationproximal algorithmalternating minimizationhierarchical minimization

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items (3)

Alternating proximal algorithms for linearly constrained variational inequalities: application to domain decomposition for PDE's ⋮ A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions ⋮ Proximal-type algorithms for split minimization problem in P-uniformly convex metric spaces

Cites Work

• The trace of Sobolev-Slobodeckij spaces on Lipschitz domains
• Primal and dual convergence of a proximal point exponential penalty method for linear programming
• Asymptotic behavior of coupled dynamical systems with multiscale aspects
• A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move
• Convergence d'un schéma de minimisation alternée
• Proximal Point Algorithm Controlled by a Slowly Vanishing Term: Applications to Hierarchical Minimization
• Weak convergence of the sequence of successive approximations for nonexpansive mappings
• 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 with asymptotically vanishing coupling. Application to domain decomposition for PDE's