Related papers: Discrete analytic functions on non-uniform lattice…
We prove that the discrete harmonic function corresponding to smooth Dirichlet boundary conditions on orthodiagonal maps, that is, plane graphs having quadrilateral faces with orthogonal diagonals, converges to its continuous counterpart as…
This paper is on further development of discrete complex analysis introduced by R. Isaacs, J. Ferrand, R. Duffin, and C. Mercat. We consider a graph lying in the complex plane and having quadrilateral faces. A function on the vertices is…
We prove a number of double-sided estimates relating discrete counterparts of several classical conformal invariants of a quadrilateral: cross-ratios, extremal lengths and random walk partition functions. The results hold true for any…
Two immersed triangulations in the plane with the same combinatorics are considered as preimage and image of a discrete immersion $F$. We compare the cross-ratios $Q$ and $q$ of corresponding pairs of adjacent triangles in the two…
We give an introduction to discrete functional analysis techniques for stationary and transient diffusion equations. We show how these techniques are used to establish the convergence of various numerical schemes without assuming…
Composite optimization problems, where the sum of a smooth and a merely lower semicontinuous function has to be minimized, are often tackled numerically by means of proximal gradient methods as soon as the lower semicontinuous part of the…
Recent studies have shown that many nonconvex machine learning problems satisfy a generalized-smooth condition that extends beyond traditional smooth nonconvex optimization. However, the existing algorithms are not fully adapted to such…
Motivated by the classical studies on transformations of conjugate nets, we develop the general geometric theory of transformations of their discrete analogues: the multidimensional quadrilateral lattices, i.e. lattices x: Z^N -> R^M, whose…
We propose a $\Gamma$-convergent discrete approximation of the Mumford-Shah functional. The discrete functionals act on functions defined on stationary stochastic lattices and take into account general finite differences through a…
We study the oracle complexity of nonsmooth nonconvex optimization, with the algorithm assumed to have access only to local function information. It has been shown by Davis, Drusvyatskiy, and Jiang (2023) that for nonsmooth Lipschitz…
Regularisation allows one to handle ill-posed inverse problems. Here we focus on discrete unfolding problems. The properties of the results are characterised by the consistency between measurements and unfolding result and by the posterior…
We study the property of uniform discreteness within discrete orbits of non-uniform lattices in $SL_2(\mathbb{R})$, acting on $\mathbb{R}^2$ by linear transformations. We provide quantitative consequences of previous results by using…
This study deals with continuous limits of interacting one-dimensional diffusive systems, arising from stochastic distortions of discrete curves with various kinds of coding representations. These systems are essentially of a…
Fractional derivatives are a well-studied generalization of integer order derivatives. Naturally, for optimization, it is of interest to understand the convergence properties of gradient descent using fractional derivatives. Convergence…
We prove two compactness results for function spaces with finite Dirichlet energy of half-space nonlocal gradients. In each of these results, we provide sufficient conditions on a sequence of kernel functions that guarantee the asymptotic…
Recently in joint work with E. Sert, we proved sharp boundedness results on discrete fractional integral operators along binary quadratic forms. Present work vastly enhances the scope of those results by extending boundedness to bivariate…
For continuous functions, midpoint convexity characterizes convex functions. By considering discrete versions of midpoint convexity, several types of discrete convexities of functions, including integral convexity, L$^\natural$-convexity…
It is well-known that entire functions whose spectrum belongs to a fixed bounded set $S$ admit real uniformly discrete uniqueness sets $\Lambda$. We show that the same is true for much wider spaces of continuous functions. In particular,…
Classical analysis of convex and non-convex optimization methods often requires the Lipshitzness of the gradient, which limits the analysis to functions bounded by quadratics. Recent work relaxed this requirement to a non-uniform smoothness…
Theoretical estimates of the convergence rate of many well-known gradient-type optimization methods are based on quadratic interpolation, provided that the Lipschitz condition for the gradient is satisfied. In this article we obtain a…