Related papers: Global symmetric approximation of frames
Suppose $k\nmid n$ and $H$ is an $n$-vertex $k$-uniform hypergraph. A near perfect matching in $H$ is a matching of size $\lfloor n/k\rfloor$. We give a divisibility barrier construction that prevents the existence of near perfect matchings…
For a given class ${\cal F}$ of uniform frames of fixed redundancy we define a Grassmannian frame as one that minimizes the maximal correlation $|< f_k,f_l >|$ among all frames $\{f_k\}_{k \in {\cal I}} \in {\cal F}$. We first analyze…
In representations using frames, oblique duality appears in situations where the analysis and the synthesis has to be done in different subspaces. In some cases, we cannot obtain an explicit expression for the oblique duals and in others…
In this paper we define "piecewise scalable frames". This new scaling process allows us to alter many frames to Parseval frames which is impossible by the previous standard scaling. We give necessary and sufficient conditions for a frame to…
We describe several algorithms for matrix completion and matrix approximation when only some of its entries are known. The approximation constraint can be any whose approximated solution is known for the full matrix. For low rank…
The problem of finding an appropriate geometrical/physical index for measuring a degree of inhomogeneity for a given space-time manifold is posed. Interrelations with the problem of understanding the gravitational/informational entropy are…
In the literature, the matchings between spacetimes have been most of the times implicitly assumed to preserve some of the symmetries of the problem involved. But no definition for this kind of matching was given until recently. Loosely…
We obtain a criterion for approximability by embeddings of piecewise linear maps of a circle to the plane, analogous to the one proved by Minc for maps of a segment to the plane. Theorem. Let S be a triangulation of a circle with s…
We discuss the concepts of pseudo-dual frames and approximately dual frames, and illuminate their relationship to classical frames. Approximately dual frames are easier to construct than the classical dual frames, and might be tailored to…
In this paper we introduce the notion of rational Hausdorff divisor, we analyze the dimension and irreducibility of its associated linear system of curves, and we prove that all irreducible real curves belonging to the linear system are…
We prove global convergence of classical projection algorithms for feasibility problems involving union convex sets, which refer to sets expressible as the union of a finite number of closed convex sets. We present a unified strategy for…
A new approximation format for solutions of partial differential equations depending on infinitely many parameters is introduced. By combining low-rank tensor approximation in a selected subset of variables with a sparse polynomial…
In this paper we present two frameworks in which global maximization of a bounded hessian function over a strongly convex set can be reduced to convex optimization. The first presented framework is a continuation of one of our previous…
The proximal point algorithm is a widely used tool for solving a variety of convex optimization problems such as finding zeros of maximally monotone operators, fixed points of nonexpansive mappings, as well as minimizing convex functions.…
If $\{x_n\}_{n \in \mathbb{N}}$ is a frame for a Hilbert space $H,$ then there exists a canonical dual frame $\{\tilde{x_n}\}_{n \in \mathbb{N}}$ such that for every $x \in H$ we have $x = \sum \langle x, \tilde{x_n} \rangle \, x_n,$ with…
In multi-objective optimization, computing the entire non-dominated set (also known as the Pareto front or the Pareto frontier) is often intractable. However, for any multiplicative factor greater than one, an approximation set can be…
This paper investigates a category of constrained fractional optimization problems that emerge in various practical applications. The objective function for this category is characterized by the ratio of a numerator and denominator, both…
In this paper, we prove that the Max-Morse Matching Problem is approximable, thus resolving an open problem posed by Joswig and Pfetsch. We describe two different approximation algorithms for the Max-Morse Matching Problem. For…
For arbitrary semimetric space $(X, d)$ and disjoint proximinal subsets $A$, $B$ of $X$ we define the proximinal graph as a bipartite graph with parts $A$ and $B$ whose edges $\{a, b\}$ satisfy the equality $d(a, b) = \operatorname{dist}(A,…
Optimal sequence alignments depend heavily on alignment scoring parameters. Given input sequences, {\em parametric alignment} is the well-studied problem that asks for all possible optimal alignment summaries as parameters vary, as well as…