相关论文: On the threshold condition for D\"orfler marking
We develop an adaptive-metric framework for norm-minimization-based outer approximation algorithms in bounded convex vector optimization. The key idea is to let the scalarization metric vary across iterations while measuring approximation…
A posteriori upper and lower bounds are derived for the linear finite element method (FEM) for the Helmholtz equation with large wave number. It is proved rigorously that the standard residual type error estimator seriously underestimates…
We propose \textit{Meta-Regularization}, a novel approach for the adaptive choice of the learning rate in first-order gradient descent methods. Our approach modifies the objective function by adding a regularization term on the learning…
We consider an adaptive algorithm for finite element methods for the isogeometric analysis (IGAFEM) of elliptic (possibly non-symmetric) second-order partial differential equations. We employ analysis-suitable T-splines of arbitrary odd…
We establish subgeometric bounds on convergence rate of general Markov processes in the Wasserstein metric. In the discrete time setting we prove that the Lyapunov drift condition and the existence of a "good" $d$-small set imply…
In this paper we prove the optimal convergence of a standard adaptive scheme based on edge finite elements for the approximation of the solutions of the eigenvalue problem associated with Maxwell's equations. The proof uses the known…
This paper presents a reliable and efficient residual-based a posteriori error analysis for the symmetric $H(\operatorname{div}\operatorname{div})$ mixed finite element method for the Kirchhoff-Love plate bending problem with mixed boundary…
This work provides a novel convergence analysis for stochastic optimization in terms of stopping times, addressing the practical reality that algorithms are often terminated adaptively based on observed progress. Unlike prior approaches,…
We propose an adaptive way to choose the anchoring parameters for the Halpern iteration to find a fixed point of a nonexpansive mapping in a real Hilbert space. We prove strong convergence of this adaptive Halpern iteration and obtain the…
We study the nonparametric estimation of the jump density of a compound Poisson process from the discrete observation of one trajectory over $[0,T]$. We consider the microscopic regime when the sampling rate $\Delta=\Delta_T\rightarrow0$ as…
We consider an elliptic partial differential equation with a random diffusion parameter discretized by a stochastic collocation method in the parameter domain and a finite element method in the spatial domain. We prove convergence of an…
In this paper, optimal convergence for an adaptive finite element algorithm for elastoplasticity is considered. To this end, the proposed adaptive algorithm is established within the abstract framework of the axioms of adaptivity [Comput.…
Sampling is a fundamental problem in computer science and statistics. However, for a given task and stream, it is often not possible to choose good sampling probabilities in advance. We derive a general framework for adaptively changing the…
Two-level domain decomposition preconditioners lead to fast convergence and scalability of iterative solvers. However, for highly heterogeneous problems, where the coefficient function is varying rapidly on several possibly non-separated…
Adaptive mesh refinement (AMR) is indispensable for efficient finite element analyses. However, its performance depends not only on the refinement itself but also on strategy to mark elements for refinement and the way it is tuned. This…
Existing analysis of AdaGrad and other adaptive methods for smooth convex optimization is typically for functions with bounded domain diameter. In unconstrained problems, previous works guarantee an asymptotic convergence rate without an…
We show the relevance of a multifractal-type analysis for pointwise convergence and divergence properties of wavelet series: Depending on the sequence space which the wavelet coefficients sequence belongs to, we obtain deterministic upper…
We consider the standard adaptive finite element loop SOLVE, ESTIMATE, MARK, REFINE, with ESTIMATE being implemented using the $p$-robust equilibrated flux estimator, and MARK being D\"orfler marking. As a refinement strategy we employ…
It is shown that delta hedging provides the optimal trading strategy in terms of minimal required initial capital to replicate a given terminal payoff in a continuous-time Markovian context. This holds true in market models where no…
In this paper, we study an adaptive finite element method for multiple eigenvalue problems of a class of second order elliptic equations. By using some eigenspace approximation technology and its crucial property which is also presented in…