相关论文: Semidefinite Representation of Convex Sets

Visualizing graphs using virtual physical models is probably the most heavily used technique for drawing graphs in practice. There are many algorithms that are efficient and produce high-quality layouts. If one requires that the layout also…

We generalize the notion of semi-universality in the classical deformation problems to the context of derived deformation theories. A criterion for a formal moduli problem to be semi-prorepresentable is produced. This can be seen as an…

This paper presents exact Semi-Definite Program (SDP) reformulations for infinite-dimensional moment optimization problems involving a new class of piecewise Sum-of-Squares (SOS)-convex functions and projected spectrahedral support sets.…

In this paper we study the relationship between the optimal value of a homogeneous quadratic optimization problem and that of its Semidefinite Programming (SDP) relaxation. We consider two quadratic optimization models: (1) $\min \{x^* C x…

Sum of squares (SOS) optimization is a powerful technique for solving problems where the positivity of a polynomials must be enforced. The common approach to solve an SOS problem is by relaxation to a Semidefinite Program (SDP). The main…

Motivated by recent advances in solution methods for mixed-integer convex optimization (MICP), we study the fundamental and open question of which sets can be represented exactly as feasible regions of MICP problems. We establish several…

In this article we study convex integer maximization problems with composite objective functions of the form $f(Wx)$, where $f$ is a convex function on $\R^d$ and $W$ is a $d\times n$ matrix with small or binary entries, over finite sets…

The subsystem compatibility problem, which concerns the question of whether a set of subsystem states are compatible with a state of the entire system, has received much study. Here we attack the problem from a new angle, utilising the…

We consider nonnegative solutions of a parabolic equation in a cylinder $D \timesI$, where $D$ is a noncompact domain of a Riemannian manifold and $I =(0,T)$ with $0 < T \le \infty$ or $I=(-\infty,0)$. Under the assumption [SSP] (i.e., the…

We focus on computing certified upper bounds for the positive maximal singular value (PMSV) of a given matrix. The PMSV problem boils down to maximizing a quadratic polynomial on the intersection of the unit sphere and the nonnegative…

Let $G$ be a countable group. We introduce several equivalence relations on the set ${\rm Sub}(G)$ of subgroups of $G$, defined by properties of the quasi-regular representations $\lambda_{G/H}$ associated to $H\in {\rm Sub}(G)$ and compare…

Let $V$ be a standard subspace in the complex Hilbert space $H$ and $G$ be a finite dimensional Lie group of unitary and antiunitary operators on $H$ containing the modular group $(\Delta_V^{it})_{t \in R}$ of $V$ and the corresponding…

Sparse high dimensional graphical model selection is a topic of much interest in modern day statistics. A popular approach is to apply l1-penalties to either (1) parametric likelihoods, or, (2) regularized regression/pseudo-likelihoods,…

A lower semi-definite self-adjoint linear operator in a Hilbert space is taken whose discrete spectrum is not empty and comprises at least several eigenvalues $\lambda_{min}=\lambda_1\leqslant\ldots\leqslant\lambda_m<\sigma_{ess}$. The…

Accurate 3D shape representation is essential in engineering applications such as design, optimization, and simulation. In practice, engineering workflows require structured, part-based representations, as objects are inherently designed as…

In this paper, we study a shrinking target problem with target at infinity in a homogeneous space of a semisimple algebraic group from the representation-theoretic point of view. Let $\rho:\mathbf G\to\mathbf{GL}(V)$ be an irreducible…

In the study of locally convex quasi *-algebras an important role is played by representable linear functionals; i.e., functionals which allow a GNS-construction. This paper is mainly devoted to the study of the continuity of representable…

In this note the smooth (i.e. with open stabilizers) linear and {\sl semilinear} representations of certain permutation groups (such as infinite symmetric group or automorphism group of an infinite-dimensional vector space over a finite…

In this article we develop new methods for exhibiting convex semialgebraic sets that are not spectrahedral shadows. We characterize when the set of nonnegative polynomials with a given support is a spectrahedral shadow in terms of sums of…

In this paper we investigate the optimal partition approach for multiparametric conic linear optimization (mpCLO) problems in which the objective function depends linearly on vectors. We first establish more useful properties of the…