相关论文: On the gradient rearrangement of functions
Gradient schemes is a framework which enables the unified convergence analysis of many different methods -- such as finite elements (conforming, non-conforming and mixed) and finite volumes methods -- for $2^{\rm nd}$ order diffusion…
We adapt the Gradient Discretisation Method (GDM), originally designed for elliptic and parabolic partial differential equations, to the case of a linear scalar hyperbolic equations. This enables the simultaneous design and convergence…
This paper studies the average gradient over the local region of a function and constructs the homogenization function of a function. It is found that there are some good properties about the local extreme points and the global extreme…
In this paper, a new re-initialization method for the conservative level-set function is put forward. First, it has been shown that the re-initialization and advection equations of the conservative level-set function are mathematically…
In this paper we establish a comparison result through symmetrization for solutions to some boundary value problems involving the fractional Laplacian. This allows to get sharp estimates for the solutions, obtained by comparing them with…
We perform a convergence analysis of a discrete-in-time minimization scheme approximating a finite dimensional singularly perturbed gradient flow. We allow for different scalings between the viscosity parameter $\varepsilon$ and the time…
This paper treats the variation of sets. We attempt to formulate convergence and continuity of set-valued functions in a different way from the theories on sequences of sets and correspondence. In the final section, we also attempt to…
We introduce a novel gradient descent algorithm extending the well-known Gradient Sampling methodology to the class of stratifiably smooth objective functions, which are defined as locally Lipschitz functions that are smooth on some regular…
Sleeve functions are generalizations of the well-established ridge functions that play a major role in the theory of partial differential equation, medical imaging, statistics, and neural networks. Where ridge functions are non-linear,…
We develop a geometric flow framework to investigate two classical shape functionals: the torsional rigidity and the first Dirichlet eigenvalue of the Laplacian. First, by constructing novel deformation paths governed by height-stretching…
We propose a mini-batching scheme for improving the theoretical complexity and practical performance of semi-stochastic gradient descent applied to the problem of minimizing a strongly convex composite function represented as the sum of an…
We present a categorical formulation of the Hamiltonian renormalisation programme for quantum field theories, establishing a systematic bridge between functional and lattice renormalisation. To this end, we introduce two categories, $Seq$…
We analyze a solution method for minimization problems over a space of $\mathbb{R}^d$-valued functions of bounded variation on an interval $I$. The presented method relies on piecewise constant iterates. In each iteration the algorithm…
This paper aims at achieving a "good" estimator for the gradient of a function on a high-dimensional space. Often such functions are not sensitive in all coordinates and the gradient of the function is almost sparse. We propose a method for…
The gradient method for minimize a differentiable convex function on Riemannian manifolds with lower bounded sectional curvature is analyzed in this paper. The analysis of the method is presented with three different finite procedures for…
We consider a methodology based in B-splines scaling functions to numerically invert Fourier or Laplace transforms of functions in the space $L^2(\mathbb{R})$. The original function is approximated by a finite combination of $j^{th}$ order…
Using an rotation of Yuan, we observe that the gradient graph of any semiconvex function is a Liouville manifold, that is, does not admit bounded harmonic functions. As a corollary, we find that any entire solution of the fourth order…
We study stochastic gradient descent (SGD) with gradient clipping on convex functions under a generalized smoothness assumption called $(L_0,L_1)$-smoothness. Using gradient clipping, we establish a high probability convergence rate that…
We develop a new proximal-gradient method for minimizing the sum of a differentiable, possibly nonconvex, function plus a convex, possibly non differentiable, function. The key features of the proposed method are the definition of a…
In this paper, usual Sturm-Liouville problems are extended for symmetric functions so that the corresponding solutions preserve the orthogonality property. Two basic examples, which are special cases of a generalized Sturm-Liouville…