Related papers: Five-Full-Block Structured Singular Values of Real…
The aim of this manuscript is to derive bounds on the moduli of eigenvalues of special type of rational matrices of the form $T(\lambda) = \displaystyle -B_0 +I\lambda +\frac{B_1}{\lambda-\alpha_1}+ \dots+ \frac{B_m}{\lambda-\alpha_m}$,…
This paper deals with the problem of constructing superregular matrices that lead to MDP convolutional codes. These matrices are a type of lower block triangular Toeplitz matrices with the property that all the square submatrices that can…
This paper studies exact semidefinite programming relaxations (SDPRs) for separable quadratically constrained quadratic programs (QCQPs). We consider the construction of a larger separable QCQP from multiple QCQPs with exact SDPRs. We show…
In this paper, which is a follow-up to [A. Borobia, R. Canogar, F. De Ter\'an, Mediterr. J. Math. 18, 40 (2021)], we provide a necessary and sufficient condition for the matrix equation $X^\top AX=B$ to be consistent when $B$ is symmetric.…
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-rank components. Such a problem arises in a number of…
Many nonconvex problems in robotics can be relaxed into convex formulations via Semi-Definite Programming (SDP) that can be solved to global optimality. The practical quality of these solutions, however, critically depends on rounding them…
Semidefinite programming (SDP) is a fundamental class of convex optimization problems with diverse applications in mathematics, engineering, machine learning, and related disciplines. This paper investigates the application of the…
We study the cone of completely positive (cp) matrices for the first interesting case $n = 5$. This is a semialgebraic set, which means that the polynomial equalities and inequlities that define its boundary can be derived. We characterize…
Energy-minimizing constraint maps are a natural extension of the obstacle problem within a vectorial framework. Due to inherent topological constraints, these maps manifest a diverse structure that includes singularities similar to harmonic…
We derive eigenvalue bounds for symmetric block-tridiagonal multiple saddle-point systems preconditioned with block-diagonal Schur complement matrices. This analysis applies to an arbitrary number of blocks and accounts for the case where…
This paper obtains a completeness result for inequational reasoning with applicative terms without variables in a setting where the intended semantic models are the full structures, the full type hierarchies over preorders for the base…
A novel lower bound is introduced for the full rank probability of random finite field matrices, where a number of elements with known location are identically zero, and remaining elements are chosen independently of each other, uniformly…
In this paper, we develop a relative error bound for nuclear norm regularized matrix completion, with the focus on the completion of full-rank matrices. Under the assumption that the top eigenspaces of the target matrix are incoherent, we…
We construct a family of functions suitable for establishing lower bounds on the oracle complexity of first-order minimization of smooth strongly-convex functions. Based on this construction, we derive new lower bounds on the complexity of…
We consider real polynomials in finitely many variables. Let the variables consist of finitely many blocks that are allowed to overlap in a certain way. Let the solution set of a finite system of polynomial inequalities be given where each…
Multiplicative matrix semigroups with constant spectral radius (c.s.r.) are studied and applied to several problems of algebra, combinatorics, functional equations, and dynamical systems. We show that all such semigroups are characterized…
We show {\it semidefinite programming} (SDP) feasibility problem is equivalent to solving a {\it convex hull relaxation} (CHR) for a finite system of quadratic equations. On the one hand, this offers a simple description of SDP. On the…
In 2006, Arveson resolved a long-standing problem by showing that for any element $x$ of a separable self-adjoint unital subspace $S\subseteq B(H)$, $\|x\|=\sup\|\pi(x)\|$, where $\pi$ runs over the boundary representations for $S$. Here we…
We investigate the conditions under which systems of two differential eigenvalue equations are quasi exactly solvable. These systems reveal a rich set of algebraic structures. Some of them are explicitely described. An exemple of quasi…
We apply duality theory to discretized convex minimization problems to obtain computable guaranteed upper bounds for the distance of given discrete functions and the exact discrete minimizer. Furthermore, we show that the discrete duality…