Related papers: Natural superconvergence points for splines
The paper addresses parametric inequality systems described by polynomial functions in finite dimensions, where state-dependent infinite parameter sets are given by finitely many polynomial inequalities and equalities. Such systems can be…
We study a stochastic first order primal-dual method for solving convex-concave saddle point problems over real reflexive Banach spaces using Bregman divergences and relative smoothness assumptions, in which we allow for stochastic error in…
This paper investigates the pathwise uniform convergence in probability of fully discrete finite-element approximations for the two-dimensional stochastic Navier-Stokes equations with multiplicative noise, subject to no-slip boundary…
A real univariate polynomial of degree $n$ is called hyperbolic if all of its $n$ roots are on the real line. Such polynomials appear quite naturally in different applications, for example, in combinatorics and optimization. The focus of…
With the help of hyper-ideal circle pattern theory, we have developed a discrete version of the classical uniformization theorems for surfaces represented as finite branched covers over the Riemann sphere as well as compact polyhedral…
The convergence theory for the gradient sampling algorithm is extended to directionally Lipschitz functions. Although directionally Lipschitz functions are not necessarily locally Lipschitz, they are almost everywhere differentiable and…
Alon and F\"uredi (European J. Combin. 1993) gave a tight bound for the following hyperplane covering problem: find the minimum number of hyperplanes required to cover all points of the n-dimensional hypercube {0,1}^n except the origin.…
A first-order `BPS' equation is obtained for 1/8 supersymmetric intersections of soliton-membranes (lumps) of supersymmetric (4+1)-dimensional massless sigma models, and a special non-singular solution is found that preserves 1/4…
We investigate the rate of convergence of the iterates of an n-dimensional quasiregular mapping within the basin of attraction of a fixed point of high local index. A key tool is a refinement of a result that gives bounds on the distortion…
Many problems in machine learning can be formulated as optimizing a convex functional over a vector space of measures. This paper studies the convergence of the mirror descent algorithm in this infinite-dimensional setting. Defining Bregman…
The numerical accuracy of particle-based approximations in Smoothed Particle Hydrodynamics (SPH) is significantly affected by the spatial uniformity of particle distributions, especially for second-order derivatives. This study aims to…
We consider the energy norm arising from elliptic problems with discontinuous piecewise constant diffusion. We prove that under the quasi-monotonicity property on the diffusion coefficient, the best approximation error with continuous…
This paper studies the convergence of a spatial semi-discretization for a backward semilinear stochastic parabolic equation. The filtration is general, and the spatial semi-discretization uses the standard continuous piecewise linear…
In this article, we improve the convergence order of some finite volume solutions approximating some second order elliptic problems. We prove that finite volume approximations of order $O(h^{k+1})$, with $k$ integer, can be obtained after…
We study the minimization of fixed-degree polynomials over the simplex. This problem is well-known to be NP-hard, as it contains the maximum stable set problem in graph theory as a special case. In this paper, we consider a rational…
Large scale optimization problems are ubiquitous in machine learning and data analysis and there is a plethora of algorithms for solving such problems. Many of these algorithms employ sub-sampling, as a way to either speed up the…
We classify all possible local linear procedures over triangular meshes resulting in polynomial $C^1$-spline functions with affinely uniform shape for the basic functions at the edges, and fitting the 9 value- and gradient data at the…
We propose and analyze a two-level method for mimetic finite difference approximations of second order elliptic boundary value problems. We prove that the two-level algorithm is uniformly convergent, i.e., the number of iterations needed to…
The Douglas-Rachford splitting algorithm is a classical optimization method that has found many applications. When specialized to two normal cone operators, it yields an algorithm for finding a point in the intersection of two convex sets.…
The discretization of least-squares problems for linear ill-posed operator equations in Hilbert spaces is considered. The main subject of this article concerns conditions for convergence of the associated discretized minimum-norm…