相关论文: Leibniz complexity of Nash functions on differenti…
We prove lower bounds on the complexity of finding $\epsilon$-stationary points (points $x$ such that $\|\nabla f(x)\| \le \epsilon$) of smooth, high-dimensional, and potentially non-convex functions $f$. We consider oracle-based complexity…
The L-fractional derivative is defined as a certain normalization of the well-known Caputo derivative, so alternative properties hold: smoothness and finite slope at the origin for the solution, velocity units for the vector field, and a…
In this paper we give an explicit solution of Dzherbashyan-Caputo-fractional Cauchy problems related to equations with derivatives of order $\nu k$, for $k$ non-negative integer and $\nu>0$. The solution is obtained by connecting the…
In this thesis, we settle the computational complexity of some fundamental questions in polynomial optimization. These include the questions of (i) finding a local minimum, (ii) testing local minimality of a point, and (iii) deciding…
The paper is an implementation in low dimensional cases of the classification method presented before by Rakhimov and Bekbaev. We give a complete classification of a subclass of complex filiform Leibniz algebras obtained from the naturally…
The goal of this paper is to extend the classical and multiplicative fractional derivatives. For this purpose, it is introduced the new extended modified Bessel function and also given an important relation between this new function…
Our overall goal is to unify and extend some results in the literature related to the approximation of generating functions of finite and infinite sequences over a field by rational functions. In our approach, numerators play a significant…
Two approximations, derived from continuous expansions of Riemann-Liouville fractional derivatives into series involving integer order derivatives, are studied. Using those series, one can formally transform any problem that contains…
From the theory of finite dimensional Lie algebras it is known that every finite dimensional Lie algebra is decomposed into a semidirect sum of semisimple subalgebra and solvable radical. Moreover, due to work of Mal'cev the study of…
The main contribution of this paper is that every convex function with non-empty relative algebraic interior of its domain is Lipschitz and subdifferentiable in some algebraic sense without any additional topological constraints. The…
Starting from a recent result expressing the Lerch zeta function as a fractional derivative, we consider further fractional derivatives of the Lerch zeta function with respect to different variables. We establish a partial differential…
Leibniz algebras are certain generalization of Lie algebras. In this paper we give classification of non-Lie solvable (left) Leibniz algebras of dimension $\leq 8$ with one dimensional derived subalgebra. We use the canonical forms for the…
We determine the computational complexity of the Hahn-Banach Extension Theorem. To do so, we investigate some basic connections between reverse mathematics and computable analysis. In particular, we use Weak Konig's Lemma within the…
We prove and collect numerous explicit and computable results for the fractional Laplacian $(-\Delta)^s f(x)$ with $s>0$ as well as its whole space inverse, the Riesz potential, $(-\Delta)^{-s}f(x)$ with $s\in\left(0,\frac{1}{2}\right)$.…
The categorical models of the differential lambda-calculus are additive categories because of the Leibniz rule which requires the summation of two expressions. This means that, as far as the differential lambda-calculus and differential…
Motivated by constraints on the dark energy equation of state from supernova-data, we propose a formalism for the Bayesian inference of functions: Starting at a functional variant of the Kullback-Leibler divergence we construct a functional…
In this work, we investigate anti-derivations and biderivation of Leibniz algebras. We describe general form of anti-derivations and biderivations on null-filiform and filiform Leibniz algebras. Moreover, we show how to construct Leibniz…
Existing Rademacher complexity bounds for neural networks rely only on norm control of the weight matrices and depend exponentially on depth via a product of the matrix norms. Lower bounds show that this exponential dependence on depth is…
Motivated by the general problem of extending the classical theory of holomorphic functions of a complex variable to the case of quater- nion functions, we give a notion of an H-derivative for functions of one quaternion variable. We show…
Lower and upper bounds for a given function are important in many mathematical and engineering contexts, where they often serve as a base for both analysis and application. In this short paper, we derive piecewise linear and quadratic…