Related papers: On an estimate in the subspace perturbation proble…
We consider the problem of super-resolving the line spectrum of a multisinusoidal signal from a finite number of samples, some of which may be completely corrupted. Measurements of this form can be modeled as an additive mixture of a…
We produce a new proof and extend results by Harrell and Stubbe for the discrete spectrum of a self-adjoint operator. An abstract approach--based on commutator algebra, the Rayleigh-Ritz principle, and an ``optimal'' usage of the…
We calculate arbitrarily tight upper and lower bounds on an unconstrained control, linear-quadratic, singularly perturbed optimal control problem whose exact solution is computationally intractable. It is well known that for the…
In this paper, we study the perturbation of the extreme singular values of a matrix in the particular case where it is obtained after appending an arbitrary column vector. Such results have many applications in bifurcation theory, signal…
In this article, we introduce a general theoretical framework to analyze non-consistent approximations of the discrete eigenmodes of a self-adjoint operator. We focus in particular on the discrete eigenvalues laying in spectral gaps. We…
This paper studies a constrained optimization problem over networked systems with an undirected and connected communication topology. The algorithm proposed in this work utilizes singular perturbation, dynamic average consensus, and saddle…
We consider a normal operator $T$ on a Hilbert space $H$. Under various assumptions on the spectrum of $T$, we give bounds for the spectrum of $T+A$ where $A$ is $T$-bounded with relative bound less than 1 but we do not assume that $A$ is…
In this work we study approximation algorithms for the \textit{Bounded Color Matching} problem (a.k.a. Restricted Matching problem) which is defined as follows: given a graph in which each edge $e$ has a color $c_e$ and a profit $p_e \in…
In this paper, we studied the equilibrium problem where the bi-function may be quasiconvex with respect to the second variable and the feasible set is the intersection of a finite number of convex sets. We propose a projection-algorithm,…
When approximating elliptic problems by using specialized approximation techniques, we obtain large structured matrices whose analysis provides information on the stability of the method. Here we provide spectral and norm estimates for…
This paper considers an optimization problem for a dynamical system whose evolution depends on a collection of binary decision variables. We develop scalable approximation algorithms with provable suboptimality bounds to provide…
We study singular Sturm-Liouville operators of the form \[ \frac{1}{r_j}\left(-\frac{\mathrm d}{\mathrm dx}p_j\frac{\mathrm d}{\mathrm dx}+q_j\right),\qquad j=0,1, \] in $L^2((a,b);r_j)$, where, in contrast to the usual assumptions, the…
Several recent papers have focused their attention in proving the correct analogue to the Lieb-Thirring inequalities for non self-adjoint operators and in finding bounds on the distribution of their eigenvalues in the complex plane. This…
We study the problem of super-resolution, where we recover the locations and weights of non-negative point sources from a few samples of their convolution with a Gaussian kernel. It has been shown that exact recovery is possible by…
Perturbed spectra are modelled to estimate OSNR for a single channel amplified link. Perturbation-dependent nonlinear noise is separated from constant ASE noise using a set of propagated perturbed spectra. A least mean square fitting is…
We consider a class of uncertain linear time-invariant overparametrized systems affected by bounded disturbances, which are described by a known exosystem with unknown initial conditions. For such systems an exponentially stable extended…
A standard perturbation result states that perturbed eigenvalues and eigenprojections admit a perturbation series provided that the operator norm of the perturbation is smaller than a constant times the corresponding eigenvalue isolation…
In this paper, we consider an unconstrained distributed optimization problem over a network of agents, in which some agents are adversarial. We solve the problem via gradient-based distributed optimization algorithm and characterize the…
The (unweighted) point-separation problem asks, given a pair of points $s$ and $t$ in the plane, and a set of candidate geometric objects, for the minimum-size subset of objects whose union blocks all paths from $s$ to $t$. Recent work has…
A mechanism is described to symmetrize the ultraspherical spectral method for self-adjoint problems. The resulting discretizations are symmetric and banded. An algorithm is presented for an adaptive spectral decomposition of self-adjoint…