Related papers: Convergent discrete Laplace-Beltrami operators ove…
In this paper we improve the spectral convergence rates for graph-based approximations of Laplace-Beltrami operators constructed from random data. We utilize regularity of the continuum eigenfunctions and strong pointwise consistency…
We consider distributed optimization with smooth convex objective functions defined on an undirected connected graph. Inspired by mirror descent mehod and RLC circuits, we propose a novel distributed mirror descent method. Compared with…
A short proof of convergence for the discretization of the Hodge-Dirac operator in the framework of discrete exterior calculus (DEC) is provided using the techniques established in [Johnny Guzm\'an and Pratyush Potu, A Framework for…
In recent years, sparse spectral methods for solving partial differential equations have been derived using hierarchies of classical orthogonal polynomials on intervals, disks, disk-slices and triangles. In this work we extend the…
Nowadays a great attention has been focused on the discrete fractional Laplace operator as the natural counterpart of the continuous one. In this paper, we discretize the fractional Laplace operator $(-\Delta)^{s}$ for an arbitrary finite…
Computing the rate-distortion function for continuous sources is commonly regarded as a standard continuous optimization problem. When numerically addressing this problem, a typical approach involves discretizing the source space and…
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…
The mirror descent algorithm is known to be effective in situations where it is beneficial to adapt the mirror map to the underlying geometry of the optimization model. However, the effect of mirror maps on the geometry of distributed…
In this paper, we propose simple numerical algorithms for partial differential equations (PDEs) defined on closed, smooth surfaces (or curves). In particular, we consider PDEs that originate from variational principles defined on the…
We develop a theoretical framework for the analysis of stabilized cut finite element methods for the Laplace-Beltrami operator on a manifold embedded in $\mathbb{R}^d$ of arbitrary codimension. The method is based on using continuous…
We introduce suitable coordinate systems for pipes and their variants that allow us to transform partial differential equations (PDEs) on the pipe surfaces or in the solid pipes into computational domains with fixed limits/ranges. Such a…
We define a class of discrete quasi convex functions, called semi-strictly quasi L$^{\natural}$-convex functions, and show that the steepest descent algorithm for L$^{\natural}$-convex function minimization also works for this class of…
The spectrum of the Laplace-Beltrami (LB) operator is central in geometric deep learning tasks, capturing intrinsic properties of the shape of the object under consideration. The best established method for its estimation, from a…
In this work we study the determinant of the Laplace-Beltrami operator on rectangular tori of unit area. We will see that the square torus gives the extremal determinant within this class of tori. The result is established by studying…
The current bottleneck of globally solving mixed-integer (non-convex) quadratically constrained problem (MIQCP) is still to construct strong but computationally cheap convex relaxations, especially when dense quadratic functions are…
In this paper, the proximal point algorithm for quasi-convex minimization problem in nonpositive curvature metric spaces is studied. We prove $\Delta$-convergence of the generated sequence to a critical point (which is defined in the text)…
The Dirichlet eigenvalues of the Laplace-Beltrami operator are larger on an annulus than on any other surface of revolution in $\mathbb{R}^3$ with the same boundary. This is established by defining a sequence of shrinking cylinders about…
Polytopal methods provide a flexible framework for the numerical approximation of partial differential equations on general meshes. Their convergence analysis raises specific challenges due to their inherently non-conforming nature and, in…
The difference-of-convex algorithm (DCA) and its variants are the most popular methods to solve the difference-of-convex optimization problem. Each iteration of them is reduced to a convex optimization problem, which generally needs to be…
We consider centralized and distributed mirror descent algorithms over a finite-dimensional Hilbert space, and prove that the problem variables converge to an optimizer of a possibly nonsmooth function when the step sizes are square…