Related papers: Structure and Interpretation of Dual-Feasible Func…
Approximating a convex function by a polyhedral function that has a limited number of facets is a fundamental problem with applications in various fields, from mitigating the curse of dimensionality in optimal control to bi-level…
We propose an algorithm for reduction of the problem of maximization of fraction of two functionals to the equivalent procedure including maximization of difference between the functionals and the solution of an equation of scalar unknown.…
Functions like the exponential, Chebyshev polynomials, and monomial symmetric polynomials are preeminent among all special functions. They have simple definitions and can be expressed using easily specified integers like n!. Families of…
The differential-reduction algorithm, which allows one to express generalized hypergeometric functions with parameters of arbitrary values in terms of such functions with parameters whose values differ from the original ones by integers, is…
Fourier series multiscale method, a concise and efficient analytical approach for multiscale computation, will be developed out of this series of papers. The second paper is concerned with simultaneous approximation to functions and their…
In the paper new representations are obtained for duals and dual hulls of the classes of analytic functions. The Ruscheweyh duality principle is shown to hold under somewhat weaker assumptions. For a compact class of functions its subclass…
We consider separable nonconvex optimization problems under affine constraints. For these problems, the Shapley-Folkman theorem provides an upper bound on the duality gap as a function of the nonconvexity of the objective functions, but…
This paper revisits the notion of classical orthogonal polynomials from a broader functional-analytic point of view. It is intended neither as a survey of known results nor as a review of the literature, but rather as a conceptual…
For many common height functions, it is notoriously hard to compute the essential minimum. Nevertheless there are two classical methods, one giving lower bounds and the other giving upper bounds. In this paper, we show that the two methods…
We study the question of the existence of a dual extremal function for a bounded matrix function on the unit circle in connection with the problem of approximation by analytic matrix functions. We characterize the class of matrix functions,…
This work proposes a conformable fractional predictor-corrector algorithm for solving conformable fractional differential equations. Fractional calculus is finding applications in various scientific fields, but existing numerical methods…
This article presents two methods, in parallel, of solving more complex integrals, among which is the Poisson's integral, in order to emphasize the obvious advantages of a new method of integration, which uses the supermathematics circular…
We derive functional a posteriori error equalities and constant free two sided estimates for certain types of partial differential equations. The error is measured in a combined norm which takes into account both the primal and dual…
We explore the feasibility of using machine learning methods to obtain an analytic form of the classical free energy functional for two model fluids, hard rods and Lennard--Jones, in one dimension . The Equation Learning Network proposed in…
We give some connections between various functions defined on finitely presented groups (isoperimetric, isodiametric, Todd-Coxeter radius, filling length functions, etc.), and we study the relation between those functions and the…
The paper is devoted to a systematic study of the duality of processes in the sense that $E f(X_t^x,y)=E f (x, Y_t^y)$ for a certain $f$. This classical topic has well known applications in interacting particles, intertwining,…
Integro-differential methods, currently exploited in calculus, provide an inexhaustible source of tools to be applied to a wide class of problems, involving the theory of special functions and other subjects. The use of integral transforms…
We show that a broad range of convex optimization algorithms, including alternating projection, operator splitting, and multiplier methods, can be systematically derived from the framework of subspace correction methods via convex duality.…
An alternative characterization of Minkowski--Lyapunov functions is derived. The derived characterization enables a computationally efficient utilization of Minkowski--Lyapunov functions in arbitrary finite dimensions. Due to intrinsic…
The umbral approach provides methods for comprehending and redefining special functions. This approach is employed efficiently in order to uncover intricacies and introduce new families of special functions. In this article, the umbral…