Related papers: A general formula for the algebraic degree in semi…
In the last years many results in the area of semidefinite programming were obtained for invariant (finite dimensional, or infinite dimensional) semidefinite programs - SDPs which have symmetry. This was done for a variety of problems and…
These lecture notes provide an informal introduction to the theory of nonnegative polynomials and sums of squares. We highlight the history and some recent developments, especially the new connections with classical (complex) algebraic…
All exactly integrable systems connected with the semisimple algebras of the second rank with an arbitrary choice of the grading in them are presented in explicit form. General solution of such systems are expressed in terms of the matrix…
The singularity degree of a semidefinite programming problem is the smallest number of facial reduction steps to make the problem strictly feasible. We introduce two new graph parameters, called the singularity degree and the nondegenerate…
In this paper we derive an upper bound for the degree of the strict invariant algebraic curve of a polynomial system in the complex project plane under generic condition. The results are obtained through the algebraic multiplicities of the…
In the context of augmented Lagrangian approaches for solving semidefinite programming problems, we investigate the possibility of eliminating the positive semidefinite constraint on the dual matrix by employing a factorization. Hints on…
In this paper, we investigate the generalized low rank approximation to the symmetric positive semidefinite matrix in the Frobenius norm: $$\underset{ rank(X)\leq k}{\min} \sum^m_{i=1}\left \Vert A_i - B_i XB_i^T \right \Vert^2_F,$$ where…
In this paper, we develop a direct formula for determining the coefficients in the canonical basis of the best polynomial of degree $M$ that approximates a polynomial of degree $N>M$ on a symmetric interval for the $\mathcal{L}^2$-norm. We…
In this paper, we present a generic parametrization of generically zero-dimensional parametric polynomial systems. More specifically, we study the specialization properties of the Rational Univariate Representation and derive bounds on the…
We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation…
A new approach to solving a class of rankconstrained semi-definite programming (SDP) problems, which appear in many signal processing applications such as transmit beamspace design in multiple-input multiple-output (MIMO) radar, downlink…
We discuss how semidefinite programming can be used to determine the second-order density matrix directly through a variational optimization. We show how the problem of characterizing a physical or N -representable density matrix leads to…
The completely bounded trace and spectral norms, for finite-dimensional spaces, are known to be efficiently expressible by semidefinite programs (J. Watrous, Theory of Computing 5: 11, 2009). This paper presents two new, and arguably much…
We discuss the nature of structure-preserving maps of varies function algebras. In particular, we identify isomorphisms between special Colombeau algebras on manifolds with invertible manifold-valued generalized functions in the case of…
We study general nilpotent algebras. The results obtained are new even for the classical algebras, such as associative or Lie algebras. We single out certain generic properties of finite-dimensional algebras, mostly over infinite fields.…
In a previous paper, we have given an algebraic model to the set of intervals. Here, we apply this model in a linear frame. We define a notion of diagonalization of square matrices whose coefficients are intervals. But in this case, with…
A graded-division algebra is an algebra graded by a group such that all nonzero homogeneous elements are invertible. This includes division algebras equipped with an arbitrary group grading (including the trivial grading). We show that a…
Algorithms are described that help with obtaining a classification of the semisimple subalgebras of a given semisimple Lie algebra, up to linear equivalence. The algorithms have been used to obtain classifications of the semisimple…
Second-order superintegrable systems in dimensions two and three are essentially classified. With increasing dimension, however, the non-linear partial differential equations employed in current methods become unmanageable. Here we propose…
These are lecture notes on the algebraic approach to regular languages. The classical algebraic approach is for finite words; it uses semigroups instead of automata. However, the algebraic approach can be extended to structures beyond…