Related papers: Minimal Projections with respect to Numerical Radi…
Given a compact manifold $ \mathcal{N} $ embedded into $ \mathbb{R}^{\nu} $ and a projection $ P $ that retracts $ \mathbb{R}^{\nu} $ except a singular set of codimension $ \ell $ onto $ \mathcal{N} $, we investigate the maximal range of…
Techniques based on minimal graph cuts have become a standard tool for solving combinatorial optimization problems arising in image processing and computer vision applications. These techniques can be used to minimize objective functions…
This paper investigates a refinement of Marstrand's projection theorem; more specifically, let $\Pi_t, t\in[0,1]$ be a family of $m$ dimensional subspaces of the Euclidean space $\mathbb{R}^n$ and let $P_t:\mathbb{R}^4\mapsto \Pi_t$ be the…
Rotation Averaging is a non-convex optimization problem that determines orientations of a collection of cameras from their images of a 3D scene. The problem has been studied using a variety of distances and robustifiers. The intrinsic (or…
Dimension reduction plays an essential role when decreasing the complexity of solving large-scale problems. The well-known Johnson-Lindenstrauss (JL) Lemma and Restricted Isometry Property (RIP) admit the use of random projection to reduce…
We give an expression for a generalized numerical radius of Hilbert space operators and then apply it to obtain upper and lower bounds for the generalized numerical radius. We also establish some generalized numerical radius inequalities…
The approximation of nonlinear kernels via linear feature maps has recently gained interest due to their applications in reducing the training and testing time of kernel-based learning algorithms. Current random projection methods avoid the…
We explore distribution questions for rational maps on the projective line $\mathbb{P}^1$ over $\mathbb{Q}$ within the framework of arithmetic dynamics, drawing analogies to elliptic curves. Specifically, we investigate counting problems…
Motivated by the notion of K-gentle partition of unity introduced in [12] and the notion of K-Lipschitz retract studied in [17], we study a weaker notion related to the Kantorovich-Rubinstein transport distance, that we call K-random…
Let $\Omega \subset \mathbb{R}^n$ be a convex polytope ($n \leq 3$). The Ritz projection is the best approximation, in the $W^{1,2}_0$-norm, to a given function in a finite element space. When such finite element spaces are constructed on…
We prove a large deviations principle for orthogonal projections of the unit ball $\mathbb{B}_p^n$ of $\ell_p^n$ onto a random $k$-dimensional linear subspace of $\mathbb{R}^n$ as $n\to\infty$ in the case $2<p\le \infty$ and for the…
Random projection (RP) is a classical technique for reducing storage and computational costs. We analyze RP-based approximations of convex programs, in which the original optimization problem is approximated by the solution of a…
A rational map with good reduction in the field $\mathbb{Q}\_p$ of $p$-adic numbers defines a $1$-Lipschitz dynamical system on the projective line $\mathbb{P}^1(\mathbb{Q}\_p)$ over $\mathbb{Q}\_p$. The dynamical structure of such a system…
We consider the unconstrained $L_2$-$L_p$ minimization: find a minimizer of $\|Ax-b\|^2_2+\lambda \|x\|^p_p$ for given $A \in R^{m\times n}$, $b\in R^m$ and parameters $\lambda>0$, $p\in [0,1)$. This problem has been studied extensively in…
Given an n-tuple {a_1, ..., a_n} of self-adjoint operators on an infinite dimensional Hilbert space H and a positive integer k, there exists a projection p of rank k such that, for each for j = 1, ..., n, pa_jp is a scalar multiple of p.…
We investigate projection constants within classes of multivariate polynomials over finite-dimensional real Hilbert spaces. Specifically, we consider the projection constant for spaces of spherical harmonics and spaces of homogeneous…
The main purpose of this survey is to gather results on the boundedness of the Bergman projection. First, we shall go over some equivalent norms on weighted Bergman spaces $A^p_\omega$ which are useful in the study of this question. In…
Recently a construction of optimal non-constant dimension subspace codes, also termed projective space codes, has been reported in a paper of Honold-Kiermaier-Kurz. Restricted to binary codes in a 5-dimensional ambient space with minimum…
We give a semidefinite programming characterizations of the numerical radius and its dual norm for quaternionic matrices. We show that the computation of the numerical radius and its dual norm within $\varepsilon$ precision are polynomially…
We study the problem of minimizing the energy function $M^p(m,n) := \min \sum_{1\le i<j\le m} |\langle v_i, v_j\rangle|^p$, where $v_i$ are unit vectors in $F^n$, $F=\mathbb R$ or $\mathbb C$, $m,n,p>0$ are integers and $p$ is even. This…