Related papers: On Subadditive Duality for Conic Mixed-Integer Pro…
Mixed-integer convex representable (MICP-R) sets are those sets that can be represented exactly through a mixed-integer convex programming formulation. Following up on recent work by Lubin et al. (2017, 2020) we investigate structural…
Our model is a generalized linear programming relaxation of a much studied random K-SAT problem. Specifically, a set of linear constraints C on K variables is fixed. From a pool of n variables, K variables are chosen uniformly at random and…
Computational methods are proposed for solving a convex quadratic program (QP). Active-set methods are defined for a particular primal and dual formulation of a QP with general equality constraints and simple lower bounds on the variables.…
We argue that the finiteness of quantum gravity amplitudes in fully compactified theories (at least in supersymmetric cases) leads to a bottom-up prediction for the existence of non-trivial dualities. In particular, finiteness requires the…
We show that double cosets of the infinite symmetric group with respect to some special subgroups admit natural structures of semigroups. We interpret elements of such semigroups in combinatorial terms (chips, colored graphs,…
In the late 1980's Sullivan initiated a programme to prove quasisymmetric rigidity in one-dimensional dynamics: interval or circle maps that are topologically conjugate are quasisymmetrically conjugate (provided some obvious necessary…
We analyze self-dual polyhedral cones and prove several properties about their slack matrices. In particular, we show that self-duality is equivalent to the existence of a positive semidefinite (PSD) slack. Beyond that, we show that if the…
It is proven that each commutative arithmetical ring $R$ has a finitistic weak dimension $\leq 2$. More precisely, this dimension is 0 if $R$ is locally IF, 1 if $R$ is locally semicoherent and not IF, and 2 in the other cases.
A double algebra is a linear space $V$ equipped with linear map $V\otimes V\to V\otimes V$. Additional conditions on this map lead to the notions of Lie and associative double algebras. We prove that simple finite-dimensional Lie double…
We establish necessary and sufficient conditions for invertibility of symmetric three-by-three block matrices having a double saddle-point structure \fb{that guarantee the unique solvability of double saddle-point systems}. We consider…
Motivated by applications requiring sparse or nonnegative controls, we investigate reachability properties of linear infinite-dimensional control problems under conic constraints. Relaxing the problem to convex constraints if the initial…
We give a necessary and sufficient condition for gluings of hyperconvex metric spaces along weakly externally hyperconvex subsets in order that the resulting space be hyperconvex. This leads to a full characterization of gluings of two…
There has been significant work recently on integer programs (IPs) $\min\{c^\top x \colon Ax\leq b,\,x\in \mathbb{Z}^n\}$ with a constraint marix $A$ with bounded subdeterminants. This is motivated by a well-known conjecture claiming that,…
Macaulay Duality, between quotients of a polynomial ring over a field, annihilated by powers of the variables, and finitely generated submodules of the ring's graded dual, is generalized over any Noetherian ring, and used to provide…
In decision-making problems under uncertainty, probabilistic constraints are a valuable tool to express safety of decisions. They result from taking the probability measure of a given set of random inequalities depending on the decision…
Even a functor without an adjoint induces a monad, namely, its codensity monad; this is subject only to the existence of certain limits. We clarify the sense in which codensity monads act as substitutes for monads induced by adjunctions. We…
In this paper, we present sufficient conditions ensuring that the sum of the image of quadratic functions and the nonnegative orthant is convex. The hidden convexity of the trust-region problem with linear inequality constraints is…
Proximal operators with affine constraints arise in numerous models in nonconvex projection, composite optimization, and structured regularization. However, their efficient computation remains challenging due to the simultaneous presence of…
Tadao Oda conjectured that every smooth polytope has the Integer Decomposition Property. In this paper, we show this result for a subclass of polytopes: smooth combinatorial cubes of any dimension.
This paper discusses a more general contractive condition for a class of extended cyclic self-mappings on the union of a finite number of subsets of a metric space which are allowed to have a finite number of successive images in the same…