Related papers: A constructive approach to strengthen algebraic de…
We consider the problem of obtaining interpolation constraints for function classes, i.e., necessary and sufficient constraints that a set of points, function values and (sub)gradients must satisfy to ensure the existence of a global…
Many practical optimization problems lack strong convexity. Fortunately, recent studies have revealed that first-order algorithms also enjoy linear convergences under various weaker regularity conditions. While the relationship among…
We study the problem of extending a positive-definite operator-valued kernel, defined on words of a fixed finite length from a free semigroup, to a global kernel defined on all words. We show that if the initial kernel satisfies a natural…
In this paper we give some sufficient conditions of analyticity and univalence for functions defined by an integral operator. Next, we refine the result to a quasiconformal extension criterion with the help of the Becker's method. Further,…
We analyze worst-case convergence guarantees of first-order optimization methods over a function class extending that of smooth and convex functions. This class contains convex functions that admit a simple quadratic upper bound. Its study…
The extension problem asks whether positive semi-definite functions on a symmetric unital subset of a discrete group can be extended to positive semi-definite functions on the whole group. It has been known at least since the work of Rudin…
In recent years there has been a collective research effort to find new formulations of reinforcement learning that are simultaneously more efficient and more amenable to analysis. This paper concerns one approach that builds on the linear…
We obtain new estimates for a class of oscillatory integral operators with folding canonical relations satisfying a curvature condition. The main lower bounds showing sharpness are proved using Kakeya set constructions. As a special case of…
The use of function contracts to specify the behavior of functions often remains limited to the scope of a single function call. Relational properties link several function calls together within a single specification. They can express more…
In this paper we extensively investigate the class of conditionally positive definite operators, namely operators generating conditionally positive definite sequences. This class itself contains subnormal operators, $2$- and $3$-isometries…
Given an arbitrary $p$-Banach ideal $(0 < p \leq 1)$, we ask for geometrical properties of this ideal which are sufficient (and necessary) to allow a transfer of the principle of local reflexivity to this operator class.
We introduce sufficient as well as necessary conditions for a compact set $K$ such that there is a continuous linear extension operator from the space of restrictions $C^\infty(K)=\lbrace F|_K: F\in C^\infty(\mathbb R)\rbrace$ to…
In this paper we consider Positive Definite functions on products $\Omega_{2q}\times\Omega_{2p}$ of complex spheres, and we obtain a condition, in terms of the coefficients in their disc polynomial expansions, which is necessary and…
The objective of this paper is to deepen the understanding of the connection between the continuous and smooth dependence of solutions on initial conditions and the regularity of the history functionals for retarded functional differential…
The well known constant rank constraint qualification [Math. Program. Study 21:110--126, 1984] introduced by Janin for nonlinear programming has been recently extended to a conic context by exploiting the eigenvector structure of the…
An algebraic $q$-difference equation is considered. A sufficient condition for the existence of a formal power-logarithmic expansion of a solution to such an equation in the neighborhood of zero is proposed. An example of applying this…
We analyze various consequences in relation to the extension of operators $T:X\to Y$ that are $p$-compact, as well as the extension of operators $T:X\to Y$ whose adjoints $T^*:Y^*\to X^*$ are $p$-compact. In most cases, we discuss these…
We propose an extension of the framework for discussing the computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represented only through approximation. The key idea…
Answer Set Programming with Quantifiers (ASP(Q)) has been introduced to provide a natural extension of ASP modeling to problems in the polynomial hierarchy (PH). However, ASP(Q) lacks a method for encoding in an elegant and compact way…
We collect and organise known results and add some new ones of the following nature: if A is a bounded operator in a Hilbert or Banach space, does there exist a nonconstant polynomial p(z) such that p(A) is "simpler", "nicer" than A. The…