Related papers: Convex Geometry of the Generalized Matrix-Fraction…
In the paper, we introduce the generalized convex function on fractal sets of real line numbers and study the properties of the generalized convex function. Based on these properties, we establish the generalized Jensen inequality and…
A general explicit form for generating functions for approximating fractional derivatives is derived. To achieve this, an equivalent characterisation for consistency and order of approximations established on a general generating function…
In the early 1960's, Moreau and Rockafellar introduced a concept of called \emph{subgradient} for convex functions, initiating the developments of theoretical and applied convex analysis. The needs of going beyond convexity motivated the…
In this paper, the generalized fractional integral operators of two generalized Mittag-Leffler type functions are investigated. The special cases of interest involve the generalized Fox--Wright function and the generalized M-series and…
In this paper we develop a geometric approach to convex subdifferential calculus in finite dimensions with employing some ideas of modern variational analysis. This approach allows us to obtain natural and rather easy proofs of basic…
Generalized Functions play a central role in the understanding of differential equations containing singularities and nonlinearities. Introducing infinitesimals and infinities to deal with these obstructions leads to controversies…
We study the space of invariant generalized functions supported on an orbit of the action of a real algebraic group on a real algebraic manifold. This space is equipped with the Bruhat filtration. We study the generating function of the…
This paper considers the minimization of a general objective function $f(X)$ over the set of rectangular $n\times m$ matrices that have rank at most $r$. To reduce the computational burden, we factorize the variable $X$ into a product of…
In this note we provide a full conjugacy and subdifferential calculus for convex convex-composite functions in finite-dimensional space. Our approach, based on infimal convolution and cone-convexity, is straightforward and yields the…
We extend Fourier analysis to curved spaces by defining a Generalized Fourier Transform (GFT) on any Riemannian manifold $\Sigma$ via spectral decomposition. Under minimal requirements that the transform is an isometric isomorphism and has…
In this paper we talk about the so-called SuperMathematics Functions (SMF), which often constiture the base for generating technical neo-geometrical objects.
CMF is a technique for simultaneously learning low-rank representations based on a collection of matrices with shared entities. A typical example is the joint modeling of user-item, item-property, and user-feature matrices in a recommender…
An important open problem in geometric complex analysis is to find algorithms for explicit determination of basic functionals intrinsically connected with conformal and quasiconformal maps, such as their Teichmuller and Grunsky norms,…
A generalized matrix function is a generalization of determinant and permanent function. In this paper, we introduced the formula for the value of a generalized matrix function of a linear sum of permutation matrices. We show that a linear…
Non-negative Matrix Factorization(NMF) algorithm can only be used to find low rank approximation of original non-negative data while Concept Factorization(CF) algorithm extends matrix factorization to single non-linear kernel space,…
In a recent survey, Schmidt compiled equivalences between generalized bent functions, group invariant Butson Hadamard matrices, and abelian splitting relative difference sets. We establish a broader network of equivalences by considering…
Non-negative matrix factorization (NMF) is an important tool in signal processing and widely used to separate mixed sources into their components. Algorithms for NMF require that the user choose the number of components in advance, and if…
An open problem in mobile manipulation is how to represent objects and scenes in a unified manner so that robots can use both for navigation and manipulation. The latter requires capturing intricate geometry while understanding fine-grained…
The umbral restyling of hypergeometric functions is shown to be a useful and efficient approach in simplifying the associated computational technicalities. In this article, the authors provide a general introduction to the umbral version of…
Using the existence of infinite numbers $k$ in the non-Archimedean ring of Robinson-Colombeau, we define the hyperfinite Fourier transform (HFT) by considering integration extended to $[-k,k]^{n}$ instead of $(-\infty,\infty)^{n}$. In order…