English
Related papers

Related papers: Semidefinite representations of non-compact convex…

200 papers

A linear matrix inequality (LMI) is a condition stating that a symmetric matrix whose entries are affine linear combinations of variables is positive semidefinite. Motivated by the fact that diagonal LMIs define polyhedra, the solution set…

Optimization and Control · Mathematics 2009-12-18 Tim Netzer , Daniel Plaumann , Markus Schweighofer

Finite unions of convex sets are a central object of study in discrete and computational geometry. In this paper we initiate a systematic study of complements of such unions -- i.e., sets of the form $S=\mathbb{R}^d \setminus (\cup_{i=1}^n…

Combinatorics · Mathematics 2025-08-28 Chaya Keller , Micha A. Perles

We extend to arbitrary finite $n$ the notion of immobilization of a convex body $O$ in $R^n$ by a finite set of points $P$ in the boundary of $O$. Because of its importance for this problem, necessary and sufficient conditions are found for…

Metric Geometry · Mathematics 2018-10-29 Anthony David Gilbert , Saul Hannington Nsubuga

We explore "semibounded" expansions of arbitrary ordered groups; namely, expansions that do not define a field on the whole universe. We show that if $\mathcal R=\langle R, <, +, \dots\rangle$ is a semibounded o-minimal structure and…

Logic · Mathematics 2021-06-24 Pantelis E. Eleftheriou , Alex Savatovsky

Given a semialgebraic set-valued map $F \colon \mathbb{R}^n \rightrightarrows \mathbb{R}^m$ with closed graph, we show that the map $F$ is Holder metrically subregular and that the following conditions are equivalent: (i) $F$ is an open map…

Optimization and Control · Mathematics 2020-04-15 Jae Hyoung Lee , Tien-Son Pham

We associate with each convex optimization problem, posed on some locally convex space, with infinitely many constraints indexed by the set T, and a given non-empty family H of finite subsets of T, a suitable Lagrangian-Haar dual problem.…

Optimization and Control · Mathematics 2021-06-04 Nguyen Dih , Miguel A. Goberna , Marco A. López , Michel Volle

We show that there are many (compact) convex semi-algebraic sets in euclidean space that do not have a semidefinite representation. This gives a negative answer to a question by Nemirovski, resp. it shows that the Helton-Nie conjecture is…

Optimization and Control · Mathematics 2017-12-05 Claus Scheiderer

Let $M$ be Hadamard manifold with sectional curvature $K_{M}\leq-k^{2}$, $k>0$. Denote by $\partial_{\infty}M$ the asymptotic boundary of $M$. We say that $M$ satisfies the strict convexity condition (SC condition) if, given…

Differential Geometry · Mathematics 2013-01-04 Jaime Ripoll , Miriam Telichevesky

Motivated by the theory of graph limits, we introduce and study the convergence and limits of linear representations of finite groups over finite fields. The limit objects are infinite dimensional representations of free groups in…

Rings and Algebras · Mathematics 2015-11-20 Gabor Elek

In our previous papers, together with J. Paseka we introduced so-called sectionally pseudocomplemented lattices and posets and illuminated their role in algebraic constructions. We believe that - similar to relatively pseudocomplemented…

Logic · Mathematics 2020-07-28 Ivan Chajda , Helmut Länger

Fix any $\lambda\in\mathbb{C}$. We say that a set $S\subseteq\mathbb{C}$ is $\lambda$-$convex$ if, whenever $a$ and $b$ are in $S$, the point $(1-\lambda)a+\lambda b$ is also in $S$. If $S$ is also (topologically) closed, then we say that…

Complex Variables · Mathematics 2020-09-01 Stephen Fenner , Frederic Green , Steven Homer

Let $p$ be a real zero polynomial in $n$ variables. Then $p$ defines a rigidly convex set $C(p)$. We construct a linear matrix inequality of size $n+1$ in the same $n$ variables that depends only on the cubic part of $p$ and defines a…

Optimization and Control · Mathematics 2023-07-26 Markus Schweighofer

A domain $S\subset{\mathbb{R}}^d$ is said to fulfill the Poincar\'{e} cone property if any point in the boundary of $S$ is the vertex of a (finite) cone which does not otherwise intersects the closure $\bar{S}$. For more than a century,…

Statistics Theory · Mathematics 2014-03-24 Alejandro Cholaquidis , Antonio Cuevas , Ricardo Fraiman

We introduce a minimalistic notion of semiclassical quantization and use it to prove that the convex hull of the semiclassical spectrum of a quantum system given by a collection of commuting operators converges to the convex hull of the…

Mathematical Physics · Physics 2017-05-17 Álvaro Pelayo , Leonid Polterovich , San Vũ Ngoc

We consider the problem of determining the closure of a quadratic module M in a commutative R-algebra with respect to the finest locally convex topology. This is of interest in deciding when the moment problem is solvable and in analyzing…

Algebraic Geometry · Mathematics 2009-04-10 Jaka Cimpric , Murray Marshall , Tim Netzer

For general quadratically-constrained quadratic programming (QCQP), we propose a parabolic relaxation described with convex quadratic constraints. An interesting property of the parabolic relaxation is that the original non-convex feasible…

Optimization and Control · Mathematics 2022-08-09 Ramtin Madani , Mersedeh Ashraphijuo , Mohsen Kheirandishfard , Alper Atamturk

This paper is concerned with the calmness of a partial perturbation to the composite rank constraint system, an intersection of the rank constraint set and a general closed set, which is shown to be equivalent to a local Lipschitz-type…

Optimization and Control · Mathematics 2022-02-08 Yitian Qian , Shaohua Pan , Yulan Liu

We consider the possibility of semisimple tensor categories whose fusion rule includes exactly one noninvertible simple object. Conditions are given for the existence or nonexistence of coherent associative structures for such fusion rules,…

Quantum Algebra · Mathematics 2014-10-01 Jacob Siehler

We study the computational question whether a given polytope or spectrahedron $S_A$ (as given by the positive semidefiniteness region of a linear matrix pencil $A(x)$) is contained in another one $S_B$. First we classify the computational…

Optimization and Control · Mathematics 2013-03-11 Kai Kellner , Thorsten Theobald , Christian Trabandt

We prove that the combinatorial optimization problem of determining the hull number of a partial cube is NP-complete. This makes partial cubes the minimal graph class for which NP-completeness of this problem is known and improves some…

Combinatorics · Mathematics 2015-10-09 Marie Albenque , Kolja Knauer
‹ Prev 1 4 5 6 7 8 10 Next ›