Related papers: On best coapproximations in subspaces of diagonal …
We propose a new randomized optimization method for high-dimensional problems which can be seen as a generalization of coordinate descent to random subspaces. We show that an adaptive sampling strategy for the random subspace significantly…
We use available measurements to estimate the unknown parameters (variance, smoothness parameter, and covariance length) of a covariance function by maximizing the joint Gaussian log-likelihood function. To overcome cubic complexity in the…
We study Birkhoff-James orthogonality and its pointwise symmetry in commutative $C^*$ algebras, i.e., the space of all continuous functions defined on a locally compact Hausdorff space that vanish at infinity. We use this characterization…
The Matrix-based Renyi's entropy enables us to directly measure information quantities from given data without the costly probability density estimation of underlying distributions, thus has been widely adopted in numerous statistical…
Motivated by the famous Blanco-Koldobsky-Turn\v{s}ek characterization of isometries, we study the \textit{approximate preservation of Birkhoff-James orthogonality by a linear operator between Banach spaces}. In particular, we investigate…
For an $n\times n$ diagonally dominant matrix $T=(t_{i,j})_{n\times n}$ with positive elements satisfying certain bounding conditions, we propose to use a diagonal matrix $S=(s_{i,j})_{n\times n}$ to approximate the inverse of $T$, where…
We study the problem of entrywise $\ell_1$ low rank approximation. We give the first polynomial time column subset selection-based $\ell_1$ low rank approximation algorithm sampling $\tilde{O}(k)$ columns and achieving an…
We present an overview to the approximation property, paying especial attention to the recent results relating the approximation property to ideals of linear operators and Lipschitz ideals. We complete the paper with some new results on…
The purpose of this work is to present the derivation and an estimate of the degrees of the best approximation based on convex, coconvex and unconstrained polynomials, and discuss some applications. We simplify the term convex and coconvex…
We prove a version of the Khinchine--Groshev theorem for Diophantine approximation of matrices subject to a congruence condition. The proof relies on an extension of the Dani correspondence to the quotient by a congruence subgroup. This…
We study the norm derivatives in the context of Birkhoff-James orthogonality in real Banach spaces. As an application of this, we obtain a complete characterization of the left-symmetric points and the right-symmetric points in a real…
We introduce and study a generalization of the notion of exact operator space that we call subexponential. Using Random Matrices we show that the factorization results of Grothendieck type that are known in the exact case all extend to the…
We research proximinality of $\mu$-sequentially compact sets and $\mu$-compact sets in measurable function spaces. Next we show a correspondence between the Kadec-Klee property for convergence in measure and $\mu$-compactness of the sets in…
Submodular maximization generalizes many fundamental problems in discrete optimization, including Max-Cut in directed/undirected graphs, maximum coverage, maximum facility location and marketing over social networks. In this paper we…
We study approximation of functions by algebraic polynomials in the H\"older spaces corresponding to the generalized Jacobi translation and the Ditzian-Totik moduli of smoothness. By using modifications of the classical moduli of…
Our principal aim is to illustrate that the concept Birkhoff-James orthogonality can be applied effectively to obtain a unified approach to a large family of optimization problems in Banach spaces. We study such optimization problems from…
We propose a general method for optimally approximating an arbitrary matrix $\mathbf{M}$ by a structured matrix $\mathbf{T}$ (circulant, Toeplitz/Hankel, etc.) and examine its use for estimating the spectra of genomic linkage disequilibrium…
We provide convergent hierarchies for the cone C of copositive matrices and its dual, the cone of completely positive matrices. In both cases the corresponding hierarchy consists of nested spectrahedra and provide outer (resp. inner)…
Let Hilb^p be the Hilbert scheme parametrizing the closed subschemes of P^n with Hilbert polynomial p \in Q[t] over a field K of characteristic zero. By bounding below the cohomological Hilbert functions of the points of Hilb^p we define…
We solve the problem of best approximation by Parseval frames to an arbitrary frame in a subspace of an infinite dimensional Hilbert space. We explicitly describe all the solutions and we give a criterion for uniqueness. This best…