Related papers: Two-Term Disjunctions on the Second-Order Cone
A new algorithm for the determination of the relative convex hull in the plane of a simple polygon A with respect to another simple polygon B which contains A, is proposed. The relative convex hull is also known as geodesic convex hull, and…
We revisit a problem considered by Chow and Hale on the existence of subharmonic solutions for perturbed systems. In the analytic setting, under more general (weaker) conditions, we prove their results on the existence of bifurcation curves…
This paper contributes to the exploration of a recently introduced computational paradigm known as second-order flows, which are characterized by novel dissipative hyperbolic partial differential equations extending accelerated gradient…
In this paper we consider the problem of distributed nonlinear optimisation of a separable convex cost function over a graph subject to cone constraints. We show how to generalise, using convex analysis, monotone operator theory and…
In this paper we provide a detailed convergence analysis for fully discrete second order (in both time and space) numerical schemes for nonlocal Allen-Cahn (nAC) and nonlocal Cahn-Hilliard (nCH) equations. The unconditional unique…
We study the convex hulls of reachable sets of nonlinear systems with bounded disturbances and uncertain initial conditions. Reachable sets play a critical role in control, but remain notoriously challenging to compute, and existing…
The second-order tangent set is an important concept in describing the curvature of the set involved. Due to the existence of the complementarity condition, the second-order cone (SOC) complementarity set is a nonconvex set. Moreover,…
We derive a closed-form expression for the projection onto a capped rotated second-order cone -- a convex set that arises in perspective relaxations of nonlinear programs with binary indicator variables. The closed-form solution involves…
Motivated by the desire to cope with data imprecision, we study methods for taking advantage of preliminary information about point sets in order to speed up the computation of certain structures associated with them. In particular, we…
Second-order structured deformations of continua provide an extension of the multiscale geometry of first-order structured deformations by taking into account the effects of submacroscopic bending and curving. We derive here an integral…
The benefits of cutting planes based on the perspective function are well known for many specific classes of mixed-integer nonlinear programs with on/off structures. However, we are not aware of any empirical studies that evaluate their…
Various control schemes rely on a solution of a convex optimization problem involving a particular robust quadratic constraint, which can be reformulated as a linear matrix inequality using the well-known $\mathcal{S}$-lemma. However, the…
We investigate and derive second solutions to linear homogeneous second-order difference equations using a variety of methods, in each case going beyond the purely formal solution and giving explicit expressions for the second solution. We…
Previous work on convexity of neural codes has produced codes that are open-convex but not closed-convex -- or vice-versa. However, why a code is one but not the other, and how to detect such discrepancies are open questions. We tackle…
We present the derivation reduction problem for SLD-resolution, the undecidable problem of finding a finite subset of a set of clauses from which the whole set can be derived using SLD-resolution. We study the reducibility of various…
We study the ABDK relation using maximal cuts of one- and two-loop integrals with up to five external legs. We show how to find a special combination of integrals that allows the relation to exist, and how to reconstruct the terms with…
We study a cutting-plane method for semidefinite optimization problems (SDOs), and supply a proof of the method's convergence, under a boundedness assumption. By relating the method's rate of convergence to an initial outer approximation's…
We present a novel complex number formulation along with tight convex relaxations for the aircraft conflict resolution problem. Our approach combines both speed and heading control and provides global optimality guarantees despite…
We investigate a new application of Difference of Convex functions programming and DCA in solving the constrained two-dimensional non-guillotine cutting problem. This problem consists of cutting a number of rectangular pieces from a large…
In this paper, we present a method to determine if a lift-and-project cut for a mixed-integer linear program is irregular, in which case the cut is not equivalent to any intersection cut from the bases of the linear relaxation. This is an…