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

DOI10.1080/02331934.2010.511672zbMATH Open1238.65051OpenAlexW2093418273MaRDI QIDQ3225086FDOQ3225086

Authors: 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

Recommendations

• Alternating proximal algorithms for linearly constrained variational inequalities: application to domain decomposition for PDE's
• Alternating proximal algorithms for weakly coupled convex minimization problems. Applications to dynamical games and PDE's
• Alternating proximal algorithm with costs-to-move, dual description and application to PDE's
• A proximal alternating direction method for weakly coupled variational inequalities
• Augmented Lagrangian and proximal alternating direction methods of multipliers in Hilbert spaces. Applications to games, PDE's and control

zbMATH Keywords

weak convergenceconvex minimizationdomain decompositionproximal algorithmalternating minimizationhierarchical minimization

Mathematics Subject Classification ID

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

Cites Work

• A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move
• Weak convergence of the sequence of successive approximations for nonexpansive mappings
• The trace of Sobolev-Slobodeckij spaces on Lipschitz domains
• Proximal Point Algorithm Controlled by a Slowly Vanishing Term: Applications to Hierarchical Minimization
• Asymptotic behavior of coupled dynamical systems with multiscale aspects
• Primal and dual convergence of a proximal point exponential penalty method for linear programming
• Convergence d'un schéma de minimisation alternée
• A convergence result for nonautonomous subgradient evolution equations and its application to the steepest descent exponential penalty trajectory in linear programming

Cited In (6)

• Proximal-type algorithms for split minimization problem in P-uniformly convex metric spaces
• Augmented Lagrangian and proximal alternating direction methods of multipliers in Hilbert spaces. Applications to games, PDE's and control
• A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
• Alternating proximal algorithms for linearly constrained variational inequalities: application to domain decomposition for PDE's
• Alternating proximal algorithm with costs-to-move, dual description and application to PDE's
• Alternating proximal algorithms for weakly coupled convex minimization problems. Applications to dynamical games and PDE's

This page was built for publication: Alternating proximal algorithms with asymptotically vanishing coupling. Application to domain decomposition for PDE's

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3225086)