Related papers: Very badly approximable matrix functions

We consider the problem of maximizing non-negative non-decreasing set functions. Although most of the recent work focus on exploiting submodularity, it turns out that several objectives we encounter in practice are not submodular.…

A class of real functions, which is the generalization of a family of convex functions, is introduced; in this connection, we have defined $X$-convex, strictly $X$-convex, quasi-$X$-convex, strictly quasi-$X$-convex, and semi-strictly…

In the theory of approximation there are some problems on approximation of compacts in functional spaces by nonlinear families : first we deal with the polynomial case, and then we consider the analytic case. We demonstrate a negative…

The set of badly approximable $m \times n $ matrices is known to have Hausdorff dimension $mn $. Each such matrix comes with its own approximation constant $c$, and one can ask for the dimension of the set of badly approximable matrices…

Operator convex functions defined on the positive half-line play a prominent role in the theory of quantum information, where they are used to define quantum $f$-divergences. Such functions admit integral representations in terms of…

Positive definite kernels and their associated Reproducing Kernel Hilbert Spaces provide a mathematically compelling and practically competitive framework for learning from data. In this paper we take the approximation theory point of view…

Let $X$ and $Y$ be pseudocompact spaces and let the function $\Phi: X\times Y\to \mathbb R$ be separately continuous. The following conditions are equivalent: (1) there is a dense $G_\delta$ subset of $D\subset Y$ so that $\Phi$ is…

The aim of this paper is to present an original approach that takes advantage from the geometric features of strictly convex functions to tackle the problem of finding the minimum from another perspective. The general idea is that near the…

We obtained order estimations for the best uniform approximations by trigonometric polynomials and approximations by Fourier sums of classes of $2\pi$-periodic continuous functions, which $(\psi,\beta)$-derivatives $f_{\beta}^{\psi}$ belong…

We show that $C^0$-fine approximation of convex functions by smooth (or real analytic) convex functions on $\R^d$ is possible in general if and only if $d=1$. Nevertheless, for $d\geq 2$ we give a characterization of the class of convex…

In this paper, we identify a large class of hyponormal block Toeplitz operators whose self-commutators are of finite rank. \ Recall that an operator $T_\varphi$ is hyponormal and $[T_\varphi^{*}, T_\varphi]$ is a finite rank operator if and…

We characterize real functions $f$ on an interval $(-\alpha,\alpha)$ for which the entrywise matrix function $[a_{ij}] \mapsto [f(a_{ij})]$ is positive, monotone and convex, respectively, in the positive semidefiniteness order. Fractional…

We study the vanishing cycle complex $\varphi_fA_X$ for a holomorphic function $f$ on a reduced complex analytic space $X$ with $A$ a Dedekind domain (for instance, a localization of the ring of integers of a cyclotomic field, where the…

We consider discretizations of the hyper-singular integral operator on closed surfaces and show that the inverses of the corresponding system matrices can be approximated by blockwise low-rank matrices at an exponential rate in the block…

We propose a new first-order optimisation algorithm to solve high-dimensional non-smooth composite minimisation problems. Typical examples of such problems have an objective that decomposes into a non-smooth empirical risk part and a…

We study two types of approximations of Lipschitz maps with derivatives of maximal slopes on Banach spaces. First, we characterize the Radon-Nikod\'ym property in terms of strongly norm attaining Lipschitz maps and maximal derivative…

We study properties and algorithms of a minimization problem of the maximum generalized eigenvalue of symmetric-matrix-valued affine functions, which is nonsmooth and quasiconvex, and has application to eigenfrequency optimization of truss…

In this work, we introduce a highly efficient algorithm to address the nonnegative matrix underapproximation (NMU) problem, i.e., nonnegative matrix factorization (NMF) with an additional underapproximation constraint. NMU results are…

We investigate a slight weakening of the classical property of strong approximation, which we call almost strong approximation, for connected reductive algebraic groups over global fields with respect to special sets of valuations. While…

We show that many important convex matrix functions can be represented as the partial infimal projection of the generalized matrix fractional (GMF) and a relatively simple convex function. This representation provides conditions under which…