Rate of convergence for some constraint decomposition methods for nonlinear variational inequalities

DOI10.1007/s002110200404zbMath1057.65040OpenAlexW2003413173MaRDI QIDQ1865746

Publication date: 27 March 2003

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002110200404

zbMATH Keywords

convergence convex optimization numerical examples finite element multigrid methods subspace correction algorithms nonlinear variational inequalities multilevel domain decomposition

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Variational inequalities (49J40) Decomposition methods (49M27)

Related Items (31)

Additive Schwarz methods for convex optimization with backtracking ⋮ Parallel solution of American option derivatives on GPU clusters ⋮ Accelerated additive Schwarz methods for convex optimization with adaptive restart ⋮ A Multilevel Correction Method for Optimal Controls of Elliptic Equations ⋮ Domain decomposition and Uzawa-type iterative method for elliptic variational inequality ⋮ An efficient primal-dual method for the obstacle problem ⋮ Additive Schwarz preconditioners for C⁰ interior penalty methods for the obstacle problem of clamped Kirchhoff plates ⋮ Fast operator splitting methods for obstacle problems ⋮ Additive Schwarz Methods for Convex Optimization as Gradient Methods ⋮ Domain decomposition methods with graph cuts algorithms for total variation minimization ⋮ Convergence analysis of the Fast Subspace Descent method for convex optimization problems ⋮ Multigrid methods for a mixed finite element method of the Darcy-Forchheimer model ⋮ Additive Schwarz preconditioners for the obstacle problem of clamped Kirchhoff plates ⋮ On the convergence of generalized Schwarz algorithms for solving obstacle problems with elliptic operators ⋮ Domain decomposition methods for nonlocal total variation image restoration ⋮ Convergence analysis of $P_{1}$ finite element method for free boundary problems on non-overlapping subdomains ⋮ A nonlinear multigrid method for total variation minimization from image restoration ⋮ Estimation of arbitrary order central statistical moments by the multilevel Monte Carlo method ⋮ Overlap domain decomposition method for bioluminescence tomography (BLT) ⋮ A parallel multigrid method for constrained minimization problems and its application to friction, contact, and obstacle problems ⋮ Convergent non-overlapping domain decomposition methods for variational image segmentation ⋮ A posteriori error analysis for a class of integral equations and variational inequalities ⋮ A shape and topology optimization technique for solving a class of linear complementarity problems in function space ⋮ Pseudo-linear convergence of an additive Schwarz method for dual total variation minimization ⋮ Non-overlapping domain decomposition methods for dual total variation based image denoising ⋮ RECENT ADVANCES IN DOMAIN DECOMPOSITION METHODS FOR TOTAL VARIATION MINIMIZATION ⋮ Convergence Rate of Overlapping Domain Decomposition Methods for the Rudin--Osher--Fatemi Model Based on a Dual Formulation ⋮ PDE acceleration: a convergence rate analysis and applications to obstacle problems ⋮ An $L^1$ Penalty Method for General Obstacle Problems ⋮ Convergence analysis of multilevel Monte Carlo variance estimators and application for random obstacle problems ⋮ Finite algorithms for the numerical solutions of a class of nonlinear complementarity problems

This page was built for publication: Rate of convergence for some constraint decomposition methods for nonlinear variational inequalities