相关论文: Convex Hull Formulations for Mixed-Integer Multili…

In this paper we derive strong linear inequalities for sets of the form {(x, q) \in Rd \times R : q \geq Q(x), x \in Rd - int(P)}, where Q(x) : Rd \rightarrow R is a quadratic function, P \subset Rd and "int" denotes interior. Of particular…

We consider mechanics of composite materials in which thin inclusions are modeled by lower-dimensional manifolds. By successively applying the dimensional reduction to junctions and intersections within the material, a geometry of…

This paper aims to find efficient solutions to a multi-objective optimization problem (MP) with convex polynomial data. To this end, a hybrid method, which allows us to transform problem (MP) into a scalar convex polynomial optimization…

In convex integer programming, various procedures have been developed to strengthen convex relaxations of sets of integer points. On the one hand, there exist several general-purpose methods that strengthen relaxations without specific…

In this work, we develop an adaptive, multivariate partitioning algorithm for solving mixed-integer nonlinear programs (MINLP) with multi-linear terms to global optimality. This iterative algorithm primarily exploits the advantages of…

This article characterizes conjugates and subdifferentials of convex integral functionals over linear spaces of cadlag stochastic processes. The approach is based on new measurability results on the Skorokhod space and new interchange rules…

We give a closed-form expression for the associated Meixner polynomials from which we derive closed-form expressions for the associated Charlier and Laguerre polynomials by a limit procedure. These formulas are then used to derive…

A simplified, user-friendly repackaging of the curvature estimates implied by the Seiberg-Witten equations is formulated in terms of the convex hull of the set of monopole classes. New results are also obtained concerning boundary cases of…

We consider the global optimization of nonconvex quadratic programs and mixed-integer quadratic programs. We present a family of convex quadratic relaxations which are derived by convexifying nonconvex quadratic functions through…

We consider minimization problems with bisubmodular objective functions. We propose valid inequalities, namely the poly-bimatroid inequalities, and provide a complete linear description of the convex hull of the epigraph of a bisubmodular…

Recent computational investigations in polymeric and non-polymeric binary mixtures have reported anomalous relaxation features when both components exhibit very different mobilities. Anomalous relaxation is characterized by sublinear power…

We provide a pointwise bipolar theorem for liminf-closed convex sets of positive Borel measurable functions on a sigma-compact metric space without the assumption that the polar is a tight set of measures. As applications we derive a…

We develop a class of mixed-integer formulations for disjunctive constraints intermediate to the big-M and convex hull formulations in terms of relaxation strength. The main idea is to capture the best of both the big-M and convex hull…

A formula for the irregularity of abelian coverings of the projective plane is established and some applications are presented.

This current article aims to study a new subclass of meromorphic functions with positive coefficients by reconstructing a new operator in the punctured open disc. Also, some geometric properties are considered and investigated, such results…

A multivariate interpolation formula (MVIF) over finite fields is presented by using the proposed Kronecker delta function. The MVIF can be applied to yield polynomial relations over the base field among homogeneous symmetric rational…

The properties of a hinged floating elastic sheet of finite length under compression are considered. Numerical continuation is used to compute spatially localized buckled states with many spatially localized folds. Both symmetric and…

This paper contributes to the theory of cutting planes for mixed integer linear programs (MILPs). Minimal valid inequalities are well understood for a relaxation of an MILP in tableau form where all the nonbasic variables are continuous;…

In this paper we introduce and study the notion of plurisubharmonic functions in calibrated geometry. These functions generalize the classical plurisubharmonic functions from complex geometry and enjoy many of their important properties.…

The matched interface and boundary (MIB) method has a proven ability for delivering the second order accuracy in handling elliptic interface problems with arbitrarily complex interface geometries. However, its collocation formulation…