English
Related papers

Related papers: Conic Mixed-Binary Sets: Convex Hull Characterizat…

200 papers

For $ 1\le k <n$, we prove that for functions $F,G$ on $ {\Bbb R}^{n}$, any $k$-dimensional affine subspace $H \subset {\Bbb R}^{n}$, and $p,q,r \ge 2$ with $\frac{1}{p}+\frac{1}{q}+\frac{1}{r}=1$, one has the estimate $$…

Classical Analysis and ODEs · Mathematics 2016-05-13 Dan-Andrei Geba , Allan Greenleaf , Alex Iosevich , Eyvindur Palsson , Eric Sawyer

In this note, as a particular case of a more general result, we obtain the following theorem: Let $\Omega\subseteq {\bf R}^n$ be a non-empty bounded open set and let $f:\overline {\Omega}\to {\bf R}^n$ be a continuous function which is…

Analysis of PDEs · Mathematics 2016-02-17 Biagio Ricceri

We prove that invariant subbundles of the Kontsevich-Zorich cocycle respect the Hodge structure. In particular, we establish a version of Deligne semisimplicity in this context. This implies that invariant subbundles must vary polynomially…

Dynamical Systems · Mathematics 2017-10-31 Simion Filip

For any standard Borel space $B$, let $\mathcal{P}(B)$ denote the space of Borel probability measures on $B$. In relation to a difficult problem of Aldous in exchangeability theory, and in connection with arithmetic combinatorics, Austin…

Probability · Mathematics 2022-04-05 Pablo Candela , Diego González-Sánchez , Balázs Szegedy

This work is concerned with the convex analysis of functions defined on (not necessarily finite-dimensional) Hilbert spaces whose values depend solely on a certain ``spectrum'' of the arguments, a class we term ``spectral functions.'' We…

Optimization and Control · Mathematics 2026-03-11 Hòa T. Bùi , Minh N. Bùi , Christian Clason

In this work we deal with set-valued functions with values in the power set of a separated locally convex space where a nontrivial pointed convex cone induces a partial order relation. A set-valued function is evenly convex if its epigraph…

Optimization and Control · Mathematics 2025-01-13 M. D. Fajardo

In this paper, we present an algorithm for minimizing the difference between two submodular functions using a variational framework which is based on (an extension of) the concave-convex procedure [17]. Because several commonly used metrics…

Machine Learning · Computer Science 2012-07-09 Mukund Narasimhan , Jeff A. Bilmes

There is often a significant trade-off between formulation strength and size in mixed integer programming (MIP). When modeling convex disjunctive constraints (e.g. unions of convex sets), adding auxiliary continuous variables can sometimes…

Optimization and Control · Mathematics 2018-03-13 Juan Pablo Vielma

In this work, we study the well-posedness of certain sparse regularized linear regression problems, i.e., the existence, uniqueness and continuity of the solution map with respect to the data. We focus on regularization functions that are…

Statistics Theory · Mathematics 2024-09-06 Jasper Marijn Everink , Yiqiu Dong , Martin Skovgaard Andersen

We examine the duality theory for a class of non-convex functions obtained by composing a convex function with a continuous one. Using Fenchel duality, we derive a dual problem that satisfies weak duality under general assumptions. To…

Optimization and Control · Mathematics 2025-10-08 Vittorio Latorre

Given an iterated function system of affine dilations with fixed points the vertices of a regular polygon, we characterize which points in the limit set lie on the boundary of its convex hull.

Dynamical Systems · Mathematics 2018-11-20 Danny Calegari , Alden Walker

In this paper we consider convex optimization problems with stochastic composite objective function subject to (possibly) infinite intersection of constraints. The objective function is expressed in terms of expectation operator over a sum…

Optimization and Control · Mathematics 2024-12-03 Ion Necoara , Nitesh Kumar Singh

The extended weight semigroup of a homogeneous space G/H of a connected semisimple algebraic group G characterizes the spectra of the representations of G on the spaces of regular sections of homogeneous linear bundles over G/H, including…

Representation Theory · Mathematics 2011-11-15 Roman Avdeev

In this paper, we study the solution uniqueness of an individual feasible vector of a class of convex optimization problems involving convex piecewise affine functions and subject to general polyhedral constraints. This class of problems…

Optimization and Control · Mathematics 2017-11-17 Seyedahmad Mousavi , Jinglai Shen

In this paper we develop a theory of convexity for a free Abelian group M (the lattice of integer points), which we call theory of discrete convexity. We characterize those subsets X of the group M that could be call "convex". One property…

Combinatorics · Mathematics 2007-05-23 V. I. Danilov , G. A. Koshevoy

The class of $\mu$-compact sets can be considered as a natural extension of the class of compact metrizable subsets of locally convex spaces, to which the particular results well known for compact sets can be generalized. This class…

Functional Analysis · Mathematics 2010-04-23 M. E. Shirokov

We study the polyhedral structure of the static probabilistic lot-sizing problem and propose valid inequalities that integrate information from the chance constraint and the binary setup variables. We prove that the proposed inequalities…

Optimization and Control · Mathematics 2020-06-02 Xiao Liu , Simge Kucukyavuz

We study multivariate normal models that are described by linear constraints on the inverse of the covariance matrix. Maximum likelihood estimation for such models leads to the problem of maximizing the determinant function over a…

Statistics Theory · Mathematics 2009-06-22 Bernd Sturmfels , Caroline Uhler

We prove conditions for the existence of a continuous linear right inverse for a surjective convolution operator in spaces of germs of analytic functions on convex subsets of the complex plane. Considered convex sets have a countable…

Functional Analysis · Mathematics 2018-10-22 S. N. Melikhov , L. V. Khanina

We consider several classes of highly important semidefinite optimization problems that involve both a convex objective function (smooth or nonsmooth) and additional linear or nonlinear smooth and convex constraints, which are ubiquitous in…

Optimization and Control · Mathematics 2025-04-08 Dan Garber , Atara Kaplan