Related papers: Rate-Optimal Perturbation Bounds for Singular Subs…
Singular perturbations have been used to select solutions of (non-convex) variational problems with a multiplicity of minimizers. The prototype of such an approach is the gradient theory of phase transitions by L. Modica, who specialized…
In the first part of this study, a convex-constrained penalized formulation was studied for a class of constant modulus (CM) problems. In particular, the error bound techniques were shown to play a vital role in providing exact penalization…
Motivated by a need to characterize transient behaviors in large network systems in terms of relevant signal norms and worst-case input scenarios, we propose a novel approach based on existing theory for matrix pseudospectra. We extend…
Inverse problems constrained by partial differential equations (PDEs) play a critical role in model development and calibration. In many applications, there are multiple uncertain parameters in a model that must be estimated. However, high…
We consider one of the most important problems in directional statistics, namely the problem of testing the null hypothesis that the spike direction $\theta$ of a Fisher-von Mises-Langevin distribution on the $p$-dimensional unit…
Optimal transport provides a metric which quantifies the dissimilarity between probability measures. For measures supported in discrete metric spaces, finding the optimal transport distance has cubic time complexity in the size of the…
This paper is concerned with Spearman's correlation matrices under large dimensional regime, in which the data dimension diverges to infinity proportionally with the sample size. We establish the central limit theorem for the linear…
This paper starts by considering the minimization of the Renyi divergence subject to a constraint on the total variation distance. Based on the solution of this optimization problem, the exact locus of the points $\bigl( D(Q\|P_1),…
We consider the rate-distortion function for lossy source compression, as well as the channel capacity for error correction, through the lens of distributional robustness. We assume that the distribution of the source or of the additive…
In this paper, we study parametric analysis of semidefinite optimization problems w.r.t. the perturbation of the objective function. We study the behavior of the optimal partition and optimal set mapping on a so-called nonlinearity…
Let $K_n$ denote the set of all nonsingular $n\times n$ lower triangular $(0,1)$-matrices. Hong and Loewy (2004) introduced the number sequence $$ c_n=\min\{\lambda\mid\lambda~\text{is an eigenvalue of}~XX^{\rm T},~X\in K_n\},\quad…
Self-consistent perturbation expansion up to the second order in the interaction strength is used to study a single-level quantum dot with local Coulomb repulsion attached asymmetrically to two generally different superconducting leads. At…
We investigate the continuous non-monotone DR-submodular maximization problem subject to a down-closed convex solvable constraint. Our first contribution is to construct an example to demonstrate that (first-order) stationary points can…
We study the problem of efficient compression of a stochastic source of probability distributions. It can be viewed as a generalization of Shannon's source coding problem. It has relation to the theory of common randomness, as well as to…
Due to their importance in both data analysis and numerical algorithms, low rank approximations have recently been widely studied. They enable the handling of very large matrices. Tight error bounds for the computationally efficient…
We provide a first systematic treatment of so-called rectangular multispectral perturbation theory. With their paper from 2003, Hochstenbach and Plestenjak ["Backward Error, Condition Numbers, and Pseudospectra for the Multiparameter…
We derive new perturbation bounds for eigenvalues of Hermitian matrices with block structures. The structures we consider range from a standard 2-by-2 block form to block tridiagonal and tridigaonal forms. The main idea is the observation…
Bi-quadratic programming over unit spheres is a fundamental problem in quantum mechanics introduced by pioneer work of Einstein, Schr\"odinger, and others. It has been shown to be NP-hard; so it must be solve by efficient heuristic…
Linear models with additive unknown-but-bounded input disturbances are extensively used to model uncertainty in robust control systems design. Typically, the disturbance set is either assumed to be known a priori or estimated from data…
Recent interest on permutation rank modulation shows the Kendall tau metric as an important distance metric. This note documents our first efforts to obtain upper bounds on optimal code sizes (for said metric) ala Delsarte's approach. For…