Duality-based domain decomposition with natural coarse-space for variational inequalities

DOI10.1016/S0377-0427(99)00368-4zbMath0970.65074MaRDI QIDQ5928303

Zdeněk Dostál, Francisco A. M. Gomes Neto, Sandra Augusta Santos

Publication date: 21 October 2001

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

convergence; variational inequalities; quadratic programming; numerical examples; domain decomposition; parallel computation; convex programming; Lagrangian multipliers

Mathematics Subject Classification ID

65K10: Numerical optimization and variational techniques

49J40: Variational inequalities

49M37: Numerical methods based on nonlinear programming

49M27: Decomposition methods

Related Items

Scalable total BETI based algorithm for 3D coercive contact problems of linear elastostatics, Theoretically supported scalable BETI method for variational inequalities, Quasi-Newton acceleration for equality-constrained minimization, A scalable FETI-DP algorithm for a semi-coercive variational inequality, FETI based algorithms for contact problems: Scalability, large displacements and 3D Coulomb friction, Domain decomposition for generalized unilateral semi-coercive contact problem with given friction in elasticity, Scalability and FETI based algorithm for large discretized variational inequalities, A scalable FETI-DP algorithm with non-penetration mortar conditions on contact interface, Augmented Lagrangian methods under the constant positive linear dependence constraint qualification, Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization, A scalable FETI-DP algorithm for a coercive variational inequality

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A class of iterative methods for finite element equations
• A new trust region algorithm for bound constrained minimization
• Duality based domain decomposition with proportioning for the solution of free boundary problems
• A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
• Conjugate gradient method with preconditioning by projector
• An Unconventional Domain Decomposition Method for an Efficient Parallel Solution of Large-Scale Finite Element Systems
• Mixed and Hybrid Finite Element Methods
• On the Maximization of a Concave Quadratic Function with Box Constraints
• Iterative Solution Methods
• Box Constrained Quadratic Programming with Proportioning and Projections
• The Dual Schur Complement Method with Well-Posed Local Neumann Problems: Regularization with a Perturbed Lagrangian Formulation