Related papers: Discrete radar ambiguity problems
This paper deals with problem of blind identification of a graph filter and its sparse input signal, thus broadening the scope of classical blind deconvolution of temporal and spatial signals to irregular graph domains. While the…
Joint radar receive filter and waveform design is non-convex, but is individually convex for a fixed receiver filter while optimizing the waveform, and vice versa. Such classes of problems are fre- quently encountered in optimization, and…
We present a new closed form for the interpolating polynomial of the general univariate Hermite interpolation that requires only calculation of polynomial derivatives, instead of derivatives of rational functions. This result is used to…
The challenge of object categorization in images is largely due to arbitrary translations and scales of the foreground objects. To attack this difficulty, we propose a new approach called collaborative receptive field learning to extract…
In this paper, we propose a general approach for explicit a posteriori error representation for convex minimization problems using basic convex duality relations. Exploiting discrete orthogonality relations in the space of element-wise…
We consider the problem of computing univariate polynomial matrices over a field that represent minimal solution bases for a general interpolation problem, some forms of which are the vector M-Pad\'e approximation problem in [Van Barel and…
We propose a new class of convex penalty functions, called \emph{variational Gram functions} (VGFs), that can promote pairwise relations, such as orthogonality, among a set of vectors in a vector space. These functions can serve as…
In this paper we investigate existence and characterization of non-radial pseudo-radial (or separable) solutions of some semi-linear elliptic equations on symmetric 2-dimensional domains. The problem reduces to the phase plane analysis of a…
In this work, we explore the ability of NN (Neural Networks) to serve as a tool for finding eigen-pairs of ordinary differential equations. The question we aime to address is whether, given a self-adjoint operator, we can learn what are the…
The first part of this work established the foundations of a radial duality between nonnegative optimization problems, inspired by the work of (Renegar, 2016). Here we utilize our radial duality theory to design and analyze projection-free…
Testing the unimodular equivalence of two full-dimensional integral simplices can be reduced to testing unimodular permutation (UP) equivalence of two nonsingular matrices. We conduct a systematic study of UP-equivalence, which leads to the…
The sparsity constrained rank-one matrix approximation problem is a difficult mathematical optimization problem which arises in a wide array of useful applications in engineering, machine learning and statistics, and the design of…
This paper considers three inter-related adversarial inference problems involving cognitive radars. We first discuss inverse tracking of the radar to estimate the adversary's estimate of us based on the radar's actions and calibrate the…
Let G = (V, E) be a directed acyclic graph with two distinguished vertices s, t and let F be a set of forbidden pairs of vertices. We say that a path in G is safe, if it contains at most one vertex from each pair {u, v} in F. Given G and F,…
We formulate the issue of minimality of self-adjoint operators on a Hilbert space as a semi-definite problem, linking the work by Overton in [1] to the characterization of minimal hermitian matrices. This motivates us to investigate the…
We consider a multiple-input-multiple-output radar system and derive a theoretical framework for the recoverability of targets in the azimuth-range domain and the azimuth-range-Doppler domain via sparse approximation algorithms. Using tools…
We reveal a natural algebraic problem whose complexity appears to interpolate between the well-known complexity classes BQP and NP: (*) Decide whether a univariate polynomial with exactly m monomial terms has a p-adic rational root. In…
In this paper, we consider the particular case of the general rational Hermite interpolation problem where only the value of the function is interpolated at some points, and where the function and its first derivatives agree at the origin.…
In this paper matrix orthogonal polynomials in the real line are described in terms of a Riemann--Hilbert problem. This approach provides an easy derivation of discrete equations for the corresponding matrix recursion coefficients. The…
We study existence of nontrivial solutions to problem \begin{equation*} \left\lbrace \begin{array}{rcll} -\Delta u &=& \lambda u+f(u)&\text{ in }\Omega,\\ u&=&0&\text{ on }\partial \Omega, \end{array}\right. \end{equation*} where $\Omega…