Related papers: Bianalytic Maps Between Free Spectrahedra
We show that maximal $S$-free convex sets are polyhedra when $S$ is the set of integral points in some rational polyhedron of $\mathbb{R}^n$. This result extends a theorem of Lov\'asz characterizing maximal lattice-free convex sets. Our…
Matrix convexity generalizes convexity to the dimension free setting and has connections to many mathematical and applied pursuits including operator theory, quantum information, noncommutative optimization, and linear control systems. In…
This note considers softmax parameter estimation when little/no labeled training data is available, but a priori information about the relative geometry of class label log-odds boundaries is available. It is shown that `data-free' softmax…
Linear matrix Inequalities (LMIs) have had a major impact on control but formulating a problem as an LMI is an art. Recently there is the beginnings of a theory of which problems are in fact expressible as LMIs. For optimization purposes it…
In this paper, we analyze problems involving matrix variables for which we use a noncommutative algebra setting. To be more specific, we use a class of functions (called NC analytic functions) defined by power series in noncommuting…
The H-unistochastic matrices are a special class of symmetric bistochastic matrices obtained by taking the square of the absolute value of each entry of a Hermitian unitary matrix. We examine the geometric relationship of the convex hull of…
Bidimensionality theory is a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. as a tool to obtain sub-exponential time parameterized algorithms for problems on H-minor free graphs.…
We determine a DG-Lie algebra controlling deformations of a locally free module over a Lie algebroid $\mathcal{A}$. Moreover, for every flat inclusion of Lie algebroids $\mathcal{A}\subset \mathcal{L}$ we introduce semiregularity maps and…
Linear complementarity problems provide a powerful framework to model nonsmooth phenomena in a variety of real-world applications. In dynamical control systems, they appear coupled to a linear input-output system in the form of linear…
Based on various types of semi-tensor products of matrices, the corresponding equivalences of matrices are proposed. Then the corresponding vector space structures are obtained as the quotient spaces under equivalences, which are called the…
Free spectrahedra are natural objects in the theories of operator systems and spaces and completely positive maps. They also appear in various engineering applications. In this paper, free spectrahedra satisfying a Reinhardt symmetry…
Convex sets arising in a variety of applications are well-defined for every relevant dimension. Examples include the simplex and the spectraplex that correspond to probability distributions and to quantum states; combinatorial polytopes and…
This chapter is a tutorial on techniques and results in free convex algebraic geometry and free real algebraic geometry (RAG). The term free refers to the central role played by algebras of noncommutative polynomials R<x> in free (freely…
Semidefinite programming optimises a linear objective function over a spectrahedron, and is one of the major advances of mathematical optimisation. Spectrahedra are described by linear pencils, which are linear matrix polynomials with…
A Lie group $G$ endowed with a left invariant Riemannian metric $g$ is called Riemannian Lie group. Harmonic and biharmonic maps between Riemannian manifolds is an important area of investigation. In this paper, we study different aspects…
Separating high-dimensional data like images into independent latent factors, i.e independent component analysis (ICA), remains an open research problem. As we show, existing probabilistic deep generative models (DGMs), which are…
In this paper, we consider two formulations for Linear Matrix Inequalities (LMIs) under Slater type constraint qualification assumption, namely, SDP smooth and non-smooth formulations. We also propose two first-order linearly convergent…
We consider a model that arises in integer programming, and show that all irredundant inequalities are obtained from maximal lattice-free convex sets in an affine subspace. We also show that these sets are polyhedra. The latter result…
This work is concerned with the convex analysis of functions defined on (not necessarily finite-dimensional) Hilbert spaces whose values depend solely on a certain ``spectrum'' of the arguments, a class we term ``spectral functions.'' We…
The purpose of this paper is to give a self-contained overview of the theory of matrix convex sets and free spectrahedra. We will give new proofs and generalizations of key theorems. However we will also introduce various new concepts and…