Related papers: Two-Term Disjunctions on the Second-Order Cone
In this paper, we study the strength of convex relaxations obtained by convexification of aggregation of constraints for a set $S$ described by two bilinear bipartite equalities. Aggregation is the process of rescaling the original…
Using calculus we show how to prove some combinatorial inequalities of the type log-concavity or log-convexity. It is shown by this method that binomial coefficients and Stirling numbers of the first and second kinds are log-concave, and…
Cut generation and lifting are key components for the performance of state-of-the-art mathematical programming solvers. This work proposes a new general cut-and-lift procedure that exploits the combinatorial structure of 0-1 problems via a…
In [R. Andreani, G. Haeser, L. M. Mito, H. Ram\'irez C., Weak notions of nondegeneracy in nonlinear semidefinite programming, arXiv:2012.14810, 2020] the classical notion of nondegeneracy (or transversality) and Robinson's constraint…
We provide a remarkably simple algorithm to compute all (at most four) common tangents of two disjoint simple polygons. Given each polygon as a read-only array of its corners in cyclic order, the algorithm runs in linear time and constant…
This paper studies convex sets categorically, namely as algebras of a distribution monad. It is shown that convex sets occur in two dual adjunctions, namely one with preframes via the Boolean truth values {0,1} as dualising object, and one…
In this research paper, we provide a concise overview of fractal calculus applied to fractal sets. We introduce and solve a second $\alpha$-order fractal differential equation with constant coefficients across different scenarios. We…
We describe strong convex valid inequalities for conic quadratic mixed 0-1 optimization. These inequalities can be utilized for solving numerous practical nonlinear discrete optimization problems from value-at-risk minimization to queueing…
We study sets defined as the intersection of a rank-1 constraint with different choices of linear side constraints. We identify different conditions on the linear side constraints, under which the convex hull of the rank-1 set is polyhedral…
Convex algebraic geometry concerns the interplay between optimization theory and real algebraic geometry. Its objects of study include convex semialgebraic sets that arise in semidefinite programming and from sums of squares. This article…
This paper presents a convex optimization-based method for finding the globally optimal solutions of a class of mixed-integer non-convex optimal control problems. We consider problems that are non-convex in the input norm, which is a…
We define a new structure on a space endowed with convexities, and call it a fractoconvex structure (or, a space with fractoconvexity). We introduce two operations on a set of fractoconvexities and in a special case we show that they…
We describe and analyze an interior-point method to decide feasibility problems of second-order conic systems. A main feature of our algorithm is that arithmetic operations are performed with finite precision. Bounds for both the number of…
A celebrated theorem of Balas gives a linear mixed-integer formulation for the union of two nonempty polytopes whose relaxation gives the convex hull of this union. The number of inequalities in Balas formulation is linear in the number of…
In this paper, we derive some new results for the separation of two not necessarily convex cones by a (convex) cone / conical surface in real (reflexive) normed spaces. In essence, we follow the nonlinear and nonsymmetric separation…
The cone of sums of nonnegative circuits (SONCs) is a subset of the cone of nonnegative polynomials / exponential sums, which has been studied extensively in recent years. In this article, we construct a subset of the SONC cone which we…
We prove that for certain families of semi-algebraic convex bodies in 3 dimensions, the convex hull of $n$ disjoint bodies has $O(n\lambda_s(n))$ features, where $s$ is a constant depending on the family: $\lambda_s(n)$ is the maximum…
Relations between multiple unitarity cuts and coproducts of Feynman integrals are extended to allow for internal masses. These masses introduce new branch cuts, whose discontinuities can be derived by placing single propagators on shell and…
We show that a resummation of infrared logarithms is needed to obtain a sensible theoretical description of dijet rates when symmetric cuts are applied to the transverse energies of both jets. We also present the next-to-leading logarithmic…
We study a multi-period convex quadratic optimization problem, where the state evolves dynamically as an affine function of the state, control, and indicator variables in each period. We begin by projecting out the state variables using…