Related papers: On Column sufficiency and Extended Horizontal Line…
We study multivariate normal models that are described by linear constraints on the inverse of the covariance matrix. Maximum likelihood estimation for such models leads to the problem of maximizing the determinant function over a…
The theory of the column-row determinants has been considered for matrices over a non-split quaternion algebra. In this paper the concepts of column-row determinants are extending to a split quaternion algebra. New definitions of the column…
In this paper, we investigate the concept of p-convexity for sets and functions in n-dimensional Euclidean space. We establish novel algebraic and topological results within this generalized convexity framework. Furthermore, we analyze…
We consider the Dirichlet problem for a class of semilinear equations on two dimensional convex domains. We give a sufficient condition for the solution to be concave. Our condition uses comparison with ellipses, and is motivated by an idea…
A symmetric matrix $C$ is completely positive (CP) if there exists an entrywise nonnegative matrix $B$ such that $C=BB^T$. The CP-completion problem is to study whether we can assign values to the missing entries of a partial matrix (i.e.,…
In many applications, e.g., recommender systems and traffic monitoring, the data comes in the form of a matrix that is only partially observed and low rank. A fundamental data-analysis task for these datasets is matrix completion, where the…
Let T be the unit circle in the complex plane C. This paper proves the existence of analytic structure in a compact subset K of T X C^n, where K has so-called "lineally convex" or "hypoconvex" fibers over T. It also addresses a related…
We consider the matrix completion problem where the aim is to esti-mate a large data matrix for which only a relatively small random subset of its entries is observed. Quite popular approaches to matrix completion problem are iterative…
We extend Berge's Maximum Theorem to allow for incomplete preferences. We first provide a simple version of the Maximum Theorem for convex feasible sets and a fixed preference. Then, we show that if, in addition to the traditional…
Despite the popularity of low-rank matrix completion, the majority of its theory has been developed under the assumption of random observation patterns, whereas very little is known about the practically relevant case of non-random…
A complex potential is a holomorphic function $\Omega:\mathbb{C} \to \mathbb{C}$ whose real and imaginary parts generate a pair of orthogonal foliations, representing the equipotential lines and the streamlines of $\dot{z} =…
We present a successive constraint approach that makes it possible to cheaply solve large-scale linear matrix inequalities for a large number of parameter values. The efficiency of our method is made possible by an offline/online…
This work deals with the homogenization of functionals with linear growth in the context of $\mathcal{A}$-quasiconvexity. A representation theorem is proved, where the new integrand function is obtained by solving a cell problem where the…
In an attempt to progress towards proving the conjecture the numerical range W (A) is a 2--spectral set for the matrix A, we propose a study of various constants. We review some partial results, many problems are still open. We describe our…
This paper is concerned with the positive definite solutions to the matrix equation $X+A^{\mathrm{H}}\bar{X}^{-1}A=I$ where $X$ is the unknown and $A$ is a given complex matrix. By introducing and studying a matrix operator on complex…
Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…
We give a sufficient condition under which every finite-satisfiable formula of a given PCTL fragment has a model with at most doubly exponential number of states (consequently, the finite satisfiability problem for the fragment is in…
A system of singular integral equations with monotone and concave nonlinearity in the subcritical case is investigated. The specified system and its scalar analog have direct applications in various areas of physics and biology. In…
Motivated by applications requiring sparse or nonnegative controls, we investigate reachability properties of linear infinite-dimensional control problems under conic constraints. Relaxing the problem to convex constraints if the initial…
We show convexity of solutions to a class of convex variational problems in the Gauss and in the Wiener space. An important tool in the proof is a representation formula for integral functionals in this infinite dimensional setting, that…