中文
相关论文

相关论文: Lifts of convex sets and cone factorizations

200 篇论文

Using suitable convex functions, we construct a new family of flat Minkowski planes whose automorphism groups are at least $3$-dimensional. These planes admit groups of automorphisms isomorphic to the direct product of $\mathbb{R}$ and the…

几何拓扑 · 数学 2026-03-17 Duy Ho

We describe a technique to obtain linear descriptions for polytopes from extended formulations. The simple idea is to first define a suitable lifting function and then to find linear constraints that are valid for the polytope and guarantee…

组合数学 · 数学 2011-09-06 Volker Kaibel , Andreas Loos

We study the cone of completely positive (cp) matrices for the first interesting case $n = 5$. This is a semialgebraic set, which means that the polynomial equalities and inequlities that define its boundary can be derived. We characterize…

最优化与控制 · 数学 2021-09-02 Max Pfeffer , Jose Alejandro Samper

Normal endomorphisms of von Neumann algebras need not be extendable to automorphisms of a larger von Neumann algebra, but they always have asymptotic lifts. We describe the structure of endomorphisms and their asymptotic lifts in some…

算子代数 · 数学 2011-10-26 William Arveson , Dennis Courtney

A matrix network is a family of matrices, with relatedness modeled by a weighted graph. We consider the task of completing a partially observed matrix network. We assume a novel sampling scheme where a fraction of matrices might be…

机器学习 · 计算机科学 2018-06-11 Qingyun Sun , Mengyuan Yan David Donoho , Stephen Boyd

Nearly convex sets play important roles in convex analysis, optimization and theory of monotone operators. We give a systematic study of nearly convex sets, and construct examples of subdifferentials of lower semicontinuous convex functions…

最优化与控制 · 数学 2015-07-28 Sarah M. Moffat , Walaa M. Moursi , Xianfu Wang

We study point-line configurations through the lens of projective geometry and matroid theory. Our focus is on their realisation spaces, where we introduce the concepts of liftable and quasi-liftable configurations, exploring cases in which…

组合数学 · 数学 2024-02-13 Oliver Clarke , Giacomo Masiero , Fatemeh Mohammadi

In this paper we establish a general framework in which the verification of support theorems for generalized convex functions acting between an algebraic structure and an ordered algebraic structure is still possible. As for the domain…

泛函分析 · 数学 2020-12-07 Andrzej Olbryś , Zsolt Páles

Copositive and completely positive matrices play an increasingly important role in Applied Mathematics, namely as a key concept for approximating NP-hard optimization problems. The cone of copositive matrices of a given order and the cone…

Let $K$ be an algebraically closed field endowed with a complete non-archimedean norm with valuation ring $R$. Let $f\colon Y\to X$ be a map of $K$-affinoid varieties. In this paper we study the analytic structure of the image $f(Y)\subset…

代数几何 · 数学 2007-05-23 T. S. Gardener , Hans Schoutens

In a recent article by Farah and the authors, a strong lifting theorem was proved for a class of coordinate-respecting maps between reduced products of discrete structures, hereby working under mild Forcing Axioms. We generalise this…

逻辑 · 数学 2024-11-19 Ben De Bondt , Alessandro Vignati

Functions with uniform sublevel sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used in multicriteria optimization, decision theory, mathematical…

最优化与控制 · 数学 2017-12-06 Petra Weidner

We study families of faces for convex semi-algebraic sets via the normal cycle which is a semi-algebraic set similar to the conormal variety in projective duality theory. We propose a convex algebraic notion of a "patch" -- a term recently…

代数几何 · 数学 2021-04-28 Daniel Plaumann , Rainer Sinn , Jannik Lennart Wesner

This paper introduces cutting planes that involve minimal structural assumptions, enabling the generation of strong polyhedral relaxations for a broad class of problems. We consider valid inequalities for the set $S\cap P$, where $S$ is a…

最优化与控制 · 数学 2020-02-03 Daniel Bienstock , Chen Chen , Gonzalo Muñoz

Nonnegative matrix factorization is the following problem: given a nonnegative input matrix $V$ and a factorization rank $K$, compute two nonnegative matrices, $W$ with $K$ columns and $H$ with $K$ rows, such that $WH$ approximates $V$ as…

最优化与控制 · 数学 2025-01-10 Valentin Leplat , Yurii Nesterov , Nicolas Gillis , François Glineur

In this paper, we investigate the mixed-integer nonlinear set with box constraints $X = \{(w,x)\in R\times Z^n:w\leq f(a^Tx),0\leq x\leq \mu\}$, where $f$ is a univariate concave function, $a\in R^n$, and $\mu\in Z^n_{++}$. This set arises…

最优化与控制 · 数学 2026-01-27 Keyan Li , Yan-Ru Wang , Wei-Kun Chen , Yu-Hong Dai

We introduce the monic rank of a vector relative to an affine-hyperplane section of an irreducible Zariski-closed affine cone $X$. We show that the monic rank is finite and greater than or equal to the usual $X$-rank. We describe an…

代数几何 · 数学 2020-06-15 Arthur Bik , Jan Draisma , Alessandro Oneto , Emanuele Ventura

Let $f$ be a holomorphic mapping between compact complex manifolds. We give a criterion for $f$ to have {\it unobstructed deformations}, i.e. for the local moduli space of $f$ to be smooth: this says, roughly speaking, that the group of…

复变函数 · 数学 2016-09-06 Ziv Ran

We study the order dimension of the lattice of closed sets for a convex geometry. Further, we prove the existence of large convex geometries realized by planar point sets that have very low order dimension. We show that the planar point set…

组合数学 · 数学 2015-01-29 Jonathan E. Beagley

A convex-polynomial is a convex combination of the monomials $\{1, x, x^2, \ldots\}$. This paper establishes that the convex-polynomials on $\mathbb R$ are dense in $L^p(\mu)$ and weak$^*$ dense in $L^\infty(\mu)$, precisely when…

泛函分析 · 数学 2015-11-02 Nathan S. Feldman , Paul J. McGuire
‹ 上一页 1 8 9 10 下一页 ›