Related papers: Computing nearest stable matrix pairs

We introduce the problem of adapting a stable matching to forced and forbidden pairs. Specifically, given a stable matching $M_1$, a set $Q$ of forced pairs, and a set $P$ of forbidden pairs, we want to find a stable matching that includes…

In this work, we consider the approximation of Hilbert space-valued meromorphic functions that arise as solution maps of parametric PDEs whose operator is the shift of an operator with normal and compact resolvent, e.g. the Helmholtz…

Let (M,g) be a compact Riemmanian manifold with non-empty boundary. Consider the second order hyperbolic initial-boundary value problem (\delta_t^2 + P(x,D))u = 0 in (0,T) x M, u(0,x) = \delta_t u(0,x) = 0 for x in M, u(t,x) = f(t,x) on…

In the Stable Roommates Problem (SR), a set of $2n$ agents rank one another in a linear order. The goal is to find a matching that is stable: one that has no pair of agents who mutually prefer each other over their assigned partners. We…

It is well known that if a matrix $A\in\mathbb C^{n\times n}$ solves the matrix equation $f(A,A^H)=0$, where $f(x, y)$ is a linear bivariate polynomial, then $A$ is normal; $A$ and $A^H$ can be simultaneously reduced in a finite number of…

Given a set $S$ of $n$ points in $\mathbb{R}^d$, the Closest Pair problem is to find a pair of distinct points in $S$ at minimum distance. When $d$ is constant, there are efficient algorithms that solve this problem, and fast approximate…

In this paper, we demonstrate that in many NP-complete variants of the stable matching problem, such as the Stable Hypergraph Matching problem, the Stable Multicommodity Flow problem, and the College Admission problem with common quotas, a…

This paper addresses the problem of finding the closest generalized essential matrix from a given $6\times 6$ matrix, with respect to the Frobenius norm. To the best of our knowledge, this nonlinear constrained optimization problem has not…

In this paper, we study the class of relatively $D$-stable matrices and provide the conditions, sufficient for relative $D$-stability. We generalize the well-known Hadamard inequality, to provide upper bounds for the determinants of…

In this paper, we provide a dissipative Hamiltonian (DH) characterization for the set of matrices whose eigenvalues belong to a given LMI region. This characterization is a generalization of that of Choudhary et al. (Numer. Linear Algebra…

We prove that any product of two non-abelian free groups, $\Gamma=\mathbb F_m\times\mathbb F_k$, for $m,k\geq 2$, is not Hilbert-Schmidt stable. This means that there exist asymptotic representations $\pi_n:\Gamma\rightarrow…

Correspondence problems are often modelled as quadratic optimization problems over permutations. Common scalable methods for approximating solutions of these NP-hard problems are the spectral relaxation for non-convex energies and the…

This paper proposes a new method for estimating sparse precision matrices in the high dimensional setting. It has been popular to study fast computation and adaptive procedures for this problem. We propose a novel approach, called Sparse…

The Deligne-Simpson problem (DSP) (resp. the weak DSP) is formulated like this: {\em give necessary and sufficient conditions for the choice of the conjugacy classes $C_j\subset GL(n,{\bf C})$ or $c_j\subset gl(n,{\bf C})$ so that there…

This paper is concerned with the design and analysis of least squares solvers for ill-posed PDEs that are conditionally stable. The norms and the regularization term used in the least squares functional are determined by the ingredients of…

Given a matrix $A$, a matrix nearness problem seeks an $X$ that most closely approximates $A$ in the sense of minimizing $\lVert A - X\rVert$ under a variety of constraints on $X$. A generalized matrix nearness problem seeks the same but…

The classical stable marriage problem asks for a matching between a set of men and a set of women with no blocking pairs, which are pairs formed by a man and a woman who would both prefer switching from their current status to be paired up…

For a given class of structured matrices $\mathbb S$, we find necessary and sufficient conditions on vectors $x,w\in \C^{n+m}$ and $y,z \in \C^{n}$ for which there exists $\Delta=[\Delta_1~\Delta_2]$ with $\Delta_1 \in \mathbb S$ and…

In this note we study the problem of simultaneous stabilization for the algebra $A_\R(\D)$. Invertible pairs $(f_j,g_j)$, $j=1,..., n$, in a commutative unital algebra are called \textit{simultaneously stabilizable} if there exists a pair…

The notion of positive realness for linear time-invariant (LTI) dynamical systems, equivalent to passivity, is one of the oldest in system and control theory. In this paper, we consider the problem of finding the nearest positive-real (PR)…