A sufficient condition for the convergence of the inexact Uzawa algorithm for saddle point problems
Journal of Computational and Applied Mathematics
Verification methods for nonlinear equations with saddle point functions
Journal of Computational and Applied Mathematics - Special issue: Proceedings of the 6th Japan--China joint seminar on numerical mathematics, university of Tsukuba, Japan, 5-9 August 2002
Applications of smoothing methods in numerical analysis and optimization
Focus on computational neurobiology
Direct manipulation of free-form deformation using curve-pairs
Computer-Aided Design
A newton-penalty method for a simplified liquid crystal model
Advances in Computational Mathematics
Hi-index | 0.01 |
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.