Related papers: A constructive approach to strengthen algebraic de…
In [B1, Theorem 2.36] we proved the equivalence of six conditions on a continuous function f on an interval. These conditions define a subset of the set of operator convex functions, whose elements are called strongly operator convex. Two…
Via a random construction we establish necessary conditions for $L^p(\ell^q)$ inequalities for certain families of operators arising in harmonic analysis. In particular we consider dilates of a convolution kernel with compactly supported…
It has been observed that linearizability, the prevalent consistency condition for implementing concurrent objects, does not preserve some probability distributions. A stronger condition, called strong linearizability has been proposed, but…
A strong version of the Orlicz maximal operator is introduced and a natural $B_p$ condition for the rectangle case is defined to characterize its boundedness. This fact let us to describe a sufficient condition for the two weight…
Let $1\le p\le q<\infty$ and let $X$ be a $p$-convex Banach function space over a $\sigma$-finite measure $\mu$. We combine the structure of the spaces $L^p(\mu)$ and $L^q(\xi)$ for constructing the new space $S_{X_p}^{\,q}(\xi)$, where…
It is well known that the extension of Watkins' algorithm to general function approximation settings is challenging: does the projected Bellman equation have a solution? If so, is the solution useful in the sense of generating a good…
Models based on approximation capabilities have recently been studied in the context of Optimal Recovery. These models, however, are not compatible with overparametrization, since model- and data-consistent functions could then be…
In this paper we prove necessary conditions for the boundedness of fractional operators on the variable Lebesgue spaces. More precisely, we find necessary conditions on an exponent function $\pp$ for a fractional maximal operator $M_\alpha$…
A necessary and sufficient condition for the resolution of the weak extension problem is given. This criterion is applied to also give a criterion for the solvability of the classical Bochner's extension problem in the $L^p$-category. The…
Fixed-point equations with Lipschitz operators have been studied for more than a century, and are central to problems in mathematical optimization, game theory, economics, and dynamical systems, among others. When the Lipschitz constant of…
We introduce the concept of strong high-order approximate minimizers for nonconvex optimization problems. These apply in both standard smooth and composite non-smooth settings, and additionally allow convex or inexpensive constraints. An…
We study two classes of extension problems, and their interconnections: (i) Extension of positive definite (p.d.) continuous functions defined on subsets in locally compact groups $G$; (ii) In case of Lie groups, representations of the…
Real and complex norms of a linear operator acting on a normed complexified space are considered. Bounds on the ratio of these norms are given. The real and complex norms are shown to coincide for four classes of operators: 1) real linear…
We investigate exact semidefinite programming (SDP) relaxations for the problem of minimizing a nonconvex quadratic objective function over a feasible region defined by both finitely and infinitely many nonconvex quadratic inequality…
Let $p$ be an analytic function defined on the open unit disc $\mathbb{D}$ with $p(0)=1$ and $0< \alpha \leq 1$. The conditions on complex valued functions $C$, $D$ and $E$ are obtained for $p$ to be subordinate to $((1+z)/(1-z))^{\alpha}$…
In this paper, approximation by means of algebraic polynomials of classes of functions defined by a generalised modulus of smoothness of operators of differentiation of these functions is considered. We give structural characteristics of…
We study the optimization of (strongly) quasar-convex functions, a class that arises naturally in many machine learning and data science applications due to its favorable properties. The fundamental properties of this class are first…
We study the expressibility and learnability of convex optimization solution functions and their multi-layer architectural extension. The main results are: \emph{(1)} the class of solution functions of linear programming (LP) and quadratic…
We consider the class of integral operators $Q_\f$ on $L^2(\R_+)$ of the form $(Q_\f f)(x)=\int_0^\be\f (\max\{x,y\})f(y)dy$. We discuss necessary and sufficient conditions on $\phi$ to insure that $Q_{\phi}$ is bounded, compact, or in the…
We study two extension problems, and their interconnections: (i) extension of positive definite (p.d.) continuous functions defined on subsets in locally compact groups $G$; and (ii) (in case of Lie groups $G$) representations of the…