On convergence of numerical methods for variational–hemivariational inequalities under minimal solution regularity
نویسندگان
چکیده
منابع مشابه
Local convergence of quasi-Newton methods under metric regularity
We consider quasi-Newton methods for generalized equations in Banach spaces under metric regularity and give a sufficient condition for q-linear convergence. Then we show that the well-known Broyden update satisfies this sufficient condition in Hilbert spaces. We also establish various modes of q-superlinear convergence of the Broyden update under strong metric subregularity, metric regularity ...
متن کاملConvergence Analysis of Wavelet Schemes for Convection-Reaction Equations under Minimal Regularity Assumptions
In this paper, we analyze convergence rates of wavelet schemes for time-dependent convection-reaction equations within the framework of the Eulerian–Lagrangian localized adjoint method (ELLAM). Under certain minimal assumptions that guarantee H1-regularity of exact solutions, we show that a generic ELLAM scheme has a convergence rate O(h/ √ Δt +Δt) in L2-norm. Then, applying the theory of opera...
متن کاملConvergence of Discontinuous Time-stepping Schemes for a Robin Boundary Control Problem under Minimal Regularity Assumptions
The minimization of the energy functional having states constrained to semi-linear parabolic PDEs is considered. The controls act on the boundary and are of Robin type. The discrete schemes under consideration are discontinuous in time but conforming in space. Stability estimates are presented at the energy norm and at arbitrary times for the state, and adjoint variables. The estimates are deri...
متن کاملConvergence of a Discontinuous Galerkin Method for the Miscible Displacement under Minimal Regularity
Discontinuous Galerkin time discretizations are combined with the mixed finite element and continuous finite element methods to solve the miscible displacement problem. Stable schemes of arbitrary order in space and time are obtained. Under minimal regularity assumptions on the data, convergence of the scheme is proved by using compactness results for functions that may be discontinuous in time.
متن کاملOn the convergence of descent methods for monotone variational inequalities
Recently, Zhu and Marcotte [15] established the convergence of a modified descent algorithm for monotone variational inequalities. Using algorithmic equivalence results due to Patriksson [10, 11] and Larsson and Patriksson [7], we show that this convergence result may be used to establish the convergence of slightly modified versions of the classical successive approximation algorithms of Dafer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2019
ISSN: 0893-9659
DOI: 10.1016/j.aml.2019.02.007