English
Related papers

Related papers: Semidefinite representations of non-compact convex…

200 papers

Let $K\subset R^n$ be a compact basic semi-algebraic set. We provide a necessary and sufficient condition (with no a priori bounding parameter) for a real sequence $y=(y_\alpha)$, $\alpha\in N^n$, to have a finite representing Borel measure…

Optimization and Control · Mathematics 2013-07-30 Jean-Bernard Lasserre

Let $H$ be a real Hilbert space. In this short note, using some of the properties of bounded linear operators with closed range defined on $H$, certain bounds for a specific convex subset of the solution set of infinite linear…

Functional Analysis · Mathematics 2020-06-30 Projesh Nath Choudhury , M. Rajesh Kannan , K. C. Sivakumar

This paper aims to find efficient solutions to a multi-objective optimization problem (MP) with convex polynomial data. To this end, a hybrid method, which allows us to transform problem (MP) into a scalar convex polynomial optimization…

Optimization and Control · Mathematics 2020-11-03 Jae Hyoung Lee , Nithirat Sisarat , Liguo Jiao

We study connected components of the Morse boundary and their stabilisers. We introduce the notion of point-convergence and show that if the set of non-singleton connected components of the Morse boundary of a finitely generated group $G$…

Group Theory · Mathematics 2024-03-07 Annette Karrer , Babak Miraftab , Stefanie Zbinden

We study the asymptotic Dirichlet and Plateau problems on Cartan-Hadamard manifolds satisfying the so-called Strict Convexity (abbr. SC) condition. The main part of the paper consists in studying the SC condition on a manifold whose…

Differential Geometry · Mathematics 2019-11-20 Jean-baptiste Casteras , Ilkka Holopainen , Jaime Ripoll

We consider the linear conic optimization problem with the cone of nonnegative polynomials. Its dual optimization problem is the generalized moment problem. Moment-SOS relaxations are powerful for solving them. This paper studies finite…

Optimization and Control · Mathematics 2024-07-08 Lei Huang , Jiawang Nie , Ya-Xiang Yuan

In this paper we study the partial Brauer $\mathbb{C}$-algebras $\mathfrak{R}_n(\delta,\delta')$, where $n \in \mathbb{N}$ and $\delta,\delta'\in\mathbb{C}$. We show that these algebras are generically semisimple, construct the Specht…

Representation Theory · Mathematics 2017-05-10 Paul Martin , Volodymyr Mazorchuk

The problem of minimizing a multilinear function of binary variables is a well-studied NP-hard problem. The set of solutions of the standard linearization of this problem is called the multilinear set. We study a cardinality constrained…

Optimization and Control · Mathematics 2021-08-31 Rui Chen , Sanjeeb Dash , Oktay Gunluk

This paper investigates the convexity of the solution set of the linear complementarity problems over tensor spaces (TLCPs). We introduce the notion of a $T$-column sufficient tensor and study its properties and relationships with several…

Optimization and Control · Mathematics 2026-04-03 Sonali Sharma , V. Vetrivel , Jein-Shan Chen

We consider optimization problems containing nonconvex quadratic functions for which semidefinite programming (SDP) relaxations often yield strong bounds. We investigate linear inequalities that outer approximate the positive semidefinite…

Optimization and Control · Mathematics 2026-03-11 Oktay Günlük , Paul Jünger , Jeff Linderoth , Andrea Lodi , James Luedtke

We introduce a method for proving lower bounds on the efficacy of semidefinite programming (SDP) relaxations for combinatorial problems. In particular, we show that the cut, TSP, and stable set polytopes on $n$-vertex graphs are not the…

Computational Complexity · Computer Science 2014-11-25 James R. Lee , Prasad Raghavendra , David Steurer

Recently geometric hypergraphs that can be defined by intersections of pseudohalfplanes with a finite point set were defined in a purely combinatorial way. This led to extensions of earlier results about points and halfplanes to…

Combinatorics · Mathematics 2024-02-14 Balázs Keszegh

The Quadratic Assignment Problem (QAP) is an important discrete optimization instance that encompasses many well-known combinatorial optimization problems, and has applications in a wide range of areas such as logistics and computer vision.…

Optimization and Control · Mathematics 2024-10-16 Junyu Chen , Yong Sheng Soh

We study Lindstrom quantifiers that satisfy certain closure properties which are motivated by the study of polymorphisms in the context of constraint satisfaction problems (CSP). When the algebra of polymorphisms of a finite structure B…

Logic in Computer Science · Computer Science 2023-08-08 Anuj Dawar , Lauri Hella

Let $K[HK_{\Theta}]$ denote the Hecke-Kiselman algebra of a finite oriented graph $\Theta$ over an algebraically closed field $K$. All irreducible representations, and the corresponding maximal ideals of $K[HK_{\Theta}]$, are characterized…

Representation Theory · Mathematics 2021-04-16 Magdalena Wiertel

Quadratically constrained quadratic programs (QCQPs) are a fundamental class of optimization problems well-known to be NP-hard in general. In this paper we study conditions under which the standard semidefinite program (SDP) relaxation of a…

Optimization and Control · Mathematics 2020-11-17 Alex L. Wang , Fatma Kilinc-Karzan

We construct a convergent family of outer approximations for the problem of optimizing polynomial functions over convex bodies subject to polynomial constraints. This is achieved by generalizing the polarization hierarchy, which has…

Optimization and Control · Mathematics 2024-06-17 Martin Plávala , Laurens T. Ligthart , David Gross

The paper contains a characterization of compact groups $G\subseteq\GL(V)$, where $V$ is a finite dimensional real vector space, which have the following property \SP{}: the family of convex hulls of $G$-orbits is a semigroup with respect…

Metric Geometry · Mathematics 2010-09-23 V. Gichev

Earlier an arbitrary poset $P$ was proved to be isomorphic to the collection of subsets of a space $M$ with two closures which are closed in the first closure and open in the other. As a space $M$ for this representation an algebraic dual…

General Topology · Mathematics 2007-05-23 R. Breslav , A. Stavrova , R. R. Zapatrin

In this paper, we prove that the product of strongly quasi-nonexpansive $\Delta$-demiclosed mappings is also a strongly quasi-nonexpansive orbital $\Delta$-demiclosed mapping in Hadamard spaces. Additionally, we establish the…

Functional Analysis · Mathematics 2025-05-01 Wiparat Worapitpong , Parin Chaipunya , Poom Kumam , Sakan Termkaew