Related papers: On Semimonotone Star Matrices and Linear Complemen…
We show that (i) any constrained polynomial optimization problem (POP) has an equivalent formulation on a variety contained in an Euclidean sphere and (ii) the resulting semidefinite relaxations in the moment-SOS hierarchy have the constant…
We study the Lattice Isomorphism Problem (LIP), in which given two lattices L_1 and L_2 the goal is to decide whether there exists an orthogonal linear transformation mapping L_1 to L_2. Our main result is an algorithm for this problem…
Let $(X,o)$ be a complex analytic normal surface singularity with rational homology sphere link $M$. The `topological' lattice cohomology ${\mathbb H}^*=\oplus_{q\geq 0} {\mathbb H}^q$ associated with $M$ and with any of its spin$^c$…
Consider the Laguerre polynomials and deform them by the introduction in the measure of an exponential singularity at zero. In [Chen Y., Its A., J. Approx. Theory 162 (2010), 270-297, arXiv:0808.3590] the authors proved that this…
We introduce a semisimple tensor category $\mc{O}^{int}_q(m|n)$ of modules over an quantum ortho-symplectic superalgebra. It is a natural counterpart of the category of finitely dominated integrable modules over the quantum classical…
In this paper, we introduce a particular class of matrices. We study the concept of a matrix to be \emph{balanced}. We study some properties of this concept in the context of matrix operations. We examine the behaviour of various matrix…
We investigate the problem of completing partial matrices to rank-one matrices in the standard simplex. The motivation for studying this problem comes from statistics: A lack of eligible completion can provide a falsification test for…
Given a matrix of distribution functions and a quasi-stochastic matrix, i.e. an irreducible nonnegative matrix with maximal eigenvalue one and associated unique positive left and right eigenvectors, the article studies the properties of an…
In this paper we take a quasi-Newton approach to nonlinear eigenvalue problems (NEPs) of the type $M(\lambda)v=0$, where $M:\mathbb{C}\rightarrow\mathbb{C}^{n\times n}$ is a holomorphic function. We investigate which types of approximations…
In this paper we provide necessary and sufficient (KKT) conditions for global optimality for a new class of possibly nonconvex quadratically constrained quadratic programming (QCQP) problems, denoted by S-QCQP. The class consists of QCQP…
This paper has been withdrawn by the authors due to a crucial computational error. In this paper we deal with the finite case. We prove that a finite bounded ordered set can be represented as the order of principal congruences of a finite…
We classify stable and finite Morse index solutions to general semilinear elliptic equations posed in Euclidean space of dimension at most 10, or in some unbounded domains.
In this paper we give a unified proof to the soliton resolution conjecture along a sequence of times, for the semilinear focusing energy critical wave equations in the radial case and two dimensional equivariant wave map equations,…
In this paper, linearly structured partial polynomial inverse eigenvalue problem is considered for the $n\times n$ matrix polynomial of arbitrary degree $k$. Given a set of $m$ eigenpairs ($1 \leqslant m \leqslant kn$), this problem…
Linear complementarity problems are a powerful tool for modeling many practically relevant situations such as market equilibria. They also connect many sub-areas of mathematics like game theory, optimization, and matrix theory. Despite…
We consider the solution of nonlinear programs with nonlinear semidefiniteness constraints. The need for an efficient exploitation of the cone of positive semidefinite matrices makes the solution of such nonlinear semidefinite programs more…
We use the theory of quantization to introduce non-commutative versions of metric on state space and Lipschitz seminorm. We show that a lower semicontinuous matrix Lipschitz seminorm is determined by their matrix metrics on the matrix state…
We consider the linear complementarity problem with uncertain data modeled by intervals, representing the range of possible values. Many properties of the linear complementarity problem (such as solvability, uniqueness, convexity, finite…
This paper provides the best bounds to date on the number of randomly sampled entries required to reconstruct an unknown low rank matrix. These results improve on prior work by Candes and Recht, Candes and Tao, and Keshavan, Montanari, and…
The orthoscheme complex of a graded poset is a metrization of its order complex such that the simplex of each maximal chain is isometric to the Euclidean simplex of vertices $0, e_1,e_1+e_2,\ldots, e_1+e_2+ \cdots + e_n$. This notion was…