Global and superlinear convergence of inexact Uzawa methods for saddle point problems with nondifferentiable mappings

This paper investigates inexact Uzawa methods for nonlinear saddle point problems. We prove that the inexact Uzawa method converges globally and superlinearly even if the derivative of the nonlinear mapping does not exist. We show that the Newton-type decomposition method for saddle point problems is a special case of a Newton-Uzawa method. We discuss applications of inexact Uzawa methods to separable convex programming problems and coupling of finite elements/boundary elements for nonlinear interface problems.