A domain decomposition method for a kind of optimization problems

DOI10.1016/S0377-0427(02)00423-5zbMath1007.65045MaRDI QIDQ697554

S. Z. Zhou, Jin-ping Zeng

Publication date: 17 September 2002

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

zbMATH Keywords

optimization; numerical examples; domain decomposition; monotone convergence

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C30: Nonlinear programming

Related Items

Convergence analysis of generalized Schwarz algorithms for solving obstacle problems with \(T\)-monotone operator, Two-level additive Schwarz algorithms for nonlinear complementarity problem with anM-function

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Schwarz algorithm for the solution of variational inequalities with nonlinear source terms
• Multigrid Algorithms for Variational Inequalities
• Rate of Convergence of Some Space Decomposition Methods for Linear and Nonlinear Problems
• Two-level Schwarz method for unilateral variational inequalities
• On Monotone and Geometric Convergence of Schwarz Methods for Two-Sided Obstacle Problems
• An additive Schwarz method for variational inequalities
• Parallel solutions of variational inequality problems with nonlinear source terms
• Weighted max-norm estimate of additive Schwarz iteration scheme for solving linear complementarity problems