Related papers: Complete quadrics: Schubert calculus for Gaussian …
Using compactifications in the logarithmic cotangent bundle, we obtain a formula for the Chern classes of the pushforward of Lagrangian cycles under an open embedding with normal crossing complement. This generalizes earlier results of…
This paper focuses on the study of a mathematical program with equilibrium constraints, where the objective and the constraint functions are all polynomials. We present a method for finding its global minimizers and global minimum using a…
The max-cut problem is a classical graph theory problem which is NP-complete. The best polynomial time approximation scheme relies on \emph{semidefinite programming} (SDP). We study the conditions under which graphs of certain classes have…
In this paper, by improving the variable-splitting approach, we propose a new semidefinite programming (SDP) relaxation for the nonconvex quadratic optimization problem over the $\ell_1$ unit ball (QPL1). It dominates the state-of-the-art…
We define modular equations in the setting of PEL Shimura varieties as equations describing Hecke correspondences, and prove upper bounds on their degrees and heights. This extends known results about elliptic modular polynomials, and…
We propose and analyze deterministic multilevel approximations for Bayesian inversion of operator equations with uncertain distributed parameters, subject to additive Gaussian measurement data. The algorithms use a multilevel (ML) approach…
Most statistical software packages implement numerical strategies for computation of maximum likelihood estimates in random effects models. Little is known, however, about the algebraic complexity of this problem. For the one-way layout…
The elaboration of new quantization methods has recently developed the interest in the study of subalgebras of the Lie algebra of polynomial vector fields over a Euclidean space. In this framework, these subalgebras define maximal…
We present experimental work on a primal-dual framework simultaneously approximating maximum cut and weighted fractional cut-covering instances. In this primal-dual framework, we solve a semidefinite programming (SDP) relaxation to either…
The Multiplicity Conjecture is a deep problem relating the multiplicity (or degree) of a Cohen-Macaulay standard graded algebra with certain extremal graded Betti numbers in its minimal free resolution. In the case of level algebras of…
In this paper we study the relationship between the optimal value of a homogeneous quadratic optimization problem and that of its Semidefinite Programming (SDP) relaxation. We consider two quadratic optimization models: (1) $\min \{x^* C x…
This paper investigates the minimization of the expectation of piecewise polynomial loss functions over Wasserstein balls. This optimization problem often appears as a key sub-problem of distributionally robust optimization problems. We…
This paper studies a class of so-called linear semi-infinite polynomial programming (LSIPP) problems. It is a subclass of linear semi-infinite programming problems whose constraint functions are polynomials in parameters and index sets are…
The MaxCut SDP is one of the most well-known semidefinite programs, and it has many favorable properties. One of its nicest geometric/duality properties is the fact that the vertices of its feasible region correspond exactly to the cuts of…
We investigate exact semidefinite programming (SDP) relaxations for the problem of minimizing a nonconvex quadratic objective function over a feasible region defined by both finitely and infinitely many nonconvex quadratic inequality…
We introduce a new class of semidefinite programming (SDP) relaxations for sparse box-constrained quadratic programs, obtained by a novel integration of the Reformulation Linearization Technique into standard SDP relaxations while…
We present a new technique for computing Hilbert series of N=1 supersymmetric QCD in four dimensions with unitary and special unitary gauge groups. We show that the Hilbert series of this theory can be written in terms of determinants of…
The number of non-isomorphic cubic fields L sharing a common discriminant d(L) = d is called the multiplicity m = m(d) of d. For an assigned value of d, these fields are collected in a multiplet M(d) = (L(1) ,..., L(m)). In this paper, the…
Semidefinite programming (SDP) provides a powerful relaxation for the maximum cut problem. For a graph with rational weights, the decision problem of whether the SDP relaxation for the maximum cut problem is exact is known to be $NP$-hard;…
Using combinatorial properties of symmetric polynomials, we compute explicitly the Soergel modules for some permutations whose corresponding Schubert varieties are rationally smooth. We build from them diagram algebras whose module…