Related papers: Semidefinite representations of non-compact convex…
We prove some finiteness theorems for the Picard functor of an algebraic stack, in the spirit of SGA 6, exp. XII and XIII. In particular, we give a stacky version of Raynaud's relative representability theorem, we give sufficient conditions…
This paper revisits the set membership identification for linear control systems and establishes its convergence rates under relaxed assumptions on (i) the persistent excitation requirement and (ii) the system disturbances. In particular,…
We deal with linear programming problems involving absolute values in their formulations, so that they are no more expressible as standard linear programs. The presence of absolute values causes the problems to be nonconvex and nonsmooth,…
A unitary representation of a, possibly infinite dimensional, Lie group G is called semi-bounded if the corresponding operators id\pi(x) from the derived representations are uniformly bounded from above on some non-empty open subset of the…
We study a compact invariant convex set $E$ in a polar representation of a compact Lie group. Polar rapresentations are given by the adjoint action of $K$ on $\mathfrak{p}$, where $K$ is a maximal compact subgroup of a real semisimple Lie…
In this paper we continue an earlier study of ends non-compact manifolds. The over-arching goal is to investigate and obtain generalizations of Siebenmann's famous collaring theorem that may be applied to manifolds having non-stable…
A class of parabolic-parabolic Keller-Segel systems with degenerate diffusion and volume filling is studied in a bounded domain subject to no-flux boundary conditions. The equations are derived from a multiphase fluid model. The interplay…
Converging hierarchies of finite-dimensional semi-definite relaxations have been proposed for state-constrained optimal control problems featuring oscillation phe-nomena, by relaxing controls as Young measures. These semi-definite…
We consider a new hierarchy of semidefinite relaxations for the general polynomial optimization problem $(P):\:f^{\ast}=\min \{\,f(x):x\in K\,\}$ on a compact basic semi-algebraic set $K\subset\R^n$. This hierarchy combines some advantages…
This paper presents a convex sufficient condition for solving a system of nonlinear equations under parametric changes and proposes a sequential convex optimization method for solving robust optimization problems with nonlinear equality…
The Lasserre hierarchy is a systematic procedure for constructing a sequence of increasingly tight relaxations that capture the convex formulations used in the best available approximation algorithms for a wide variety of optimization…
For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…
In this paper, we introduce semi-infinite tensor complementarity problem to provide an approach for considering a more realistic situation of the problem. We prove the necessary and sufficient conditions for the existence of the solution…
We discuss a universal algebraic approach to quasi-exactly solvable models which allows us to interpret them as constrained Hamiltonian systems with a finite number of physical states. Using this approach we reproduce well-known…
This note focuses on the problem of representing convex sets as projections of the cone of positive semidefinite matrices, in the particular case of sets generated by bivariate polynomials of degree four. Conditions are given for the convex…
This paper proposes tight semidefinite relaxations for polynomial optimization. The optimality conditions are investigated. We show that generally Lagrange multipliers can be expressed as polynomial functions in decision variables over the…
We deploy algebraic complexity theoretic techniques for constructing symmetric determinantal representations of for00504925mulas and weakly skew circuits. Our representations produce matrices of much smaller dimensions than those given in…
We study the convex hull of $SO(n)$, thought of as the set of $n\times n$ orthogonal matrices with unit determinant, from the point of view of semidefinite programming. We show that the convex hull of $SO(n)$ is doubly spectrahedral, i.e.…
Lasserre's hierarchy is a sequence of semidefinite relaxations for solving polynomial optimization problems globally. This paper studies the relationship between optimality conditions in nonlinear programming theory and finite convergence…
In this article, we introduce the notions of weak boundary repre- sentation, quasi hyperrigidity and weak peak points in the non-commutative setting for operator systems in C* algebras. An analogue of Saskin theorem relating quasi…