相关论文: Estimating Maximum by Moments for Functions on Orb…
Given a unitary representation U of a compact group G and a transitive G-space $\Omega$, we characterize the extremal elements of the convex set of all U-covariant positive operator valued measures.
The problems of determining the optimal power allocation, within maximum power bounds, to (i) maximize the minimum Shannon capacity, and (ii) minimize the weighted latency are considered. In the first case, the global optima can be achieved…
We focus on computing certified upper bounds for the positive maximal singular value (PMSV) of a given matrix. The PMSV problem boils down to maximizing a quadratic polynomial on the intersection of the unit sphere and the nonnegative…
We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an…
We study the polynomial optimization problem of minimizing a multihomogeneous polynomial over the product of spheres. This polynomial optimization problem models the tensor optimization problem of finding the best rank one approximation of…
A great variety of fundamental optimization and counting problems arising in computer science, mathematics and physics can be reduced to one of the following computational tasks involving polynomials and set systems: given an $m$-variate…
Let $(\Omega, \mathcal{F}, \mathbf{P})$ be a probability space, $\xi$ be a random variable on $(\Omega, \mathcal{F}, \mathbf{P})$, $\mathcal{G}$ be a sub-$\sigma$-algebra of $\mathcal{F}$, and let $\mathbf{E}^\mathcal{G} = \mathbf{ E}(\cdot…
The maximum-entropy sampling problem is a fundamental and challenging combinatorial-optimization problem, with application in spatial statistics. It asks to find a maximum-determinant order-$s$ principal submatrix of an order-$n$ covariance…
First, we study geometric variants of the standard set cover motivated by assignment of directional antenna and shipping with deadlines, providing the first known polynomial-time exact solutions. Next, we consider the following general…
A function of a matrix is polyconvex when it can be expressed as a convex function of the matrix minors. Polyconvexity is a regularity condition ensuring existence of minimizers in nonlinear elasticity and, more broadly, in vectorial…
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient greedy algorithm and derive its formal approximation…
Weighted cone-volume functionals are introduced for the convex polytopes in $\mathbb{R}^n$. For these functionals, geometric inequalities are proved and the equality conditions are characterized. A variety of corollaries are derived,…
In this work, we exploit the capability of virtual element methods in accommodating approximation spaces featuring high-order continuity to numerically approximate differential problems of the form $\Delta^p u =f$, $p\ge1$. More…
We consider the {\em Shaped Partition Problem} of partitioning $n$ given vectors in real $k$-space into $p$ parts so as to maximize an arbitrary objective function which is convex on the sum of vectors in each part, subject to arbitrary…
In this paper we describe an algorithm that quickly computes a maximal a-valued lattice in an F-vector space equipped with a non-degenerate bilinear form, where a is a fractional ideal in a number field F. We then apply this construction to…
We show that the global minimum (resp. maximum) of a continuous function on a compact set can be approximated from above (resp. from below) by computing the smallest (rest. largest) eigenvalue of a hierarchy of (r x r) tri-diagonal…
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…
We provide an algorithm to compute the 2-norm maximum of a multilinear map over a product of spheres. As a corollary we give a method to compute the first singular value of a linear map and an application to the theory of entangled states…
We introduce orbitopes as the convex hulls of 0/1-matrices that are lexicographically maximal subject to a group acting on the columns. Special cases are packing and partitioning orbitopes, which arise from restrictions to matrices with at…
We study the maximum Hamming distance (or rather, the complementary notion of "minimum approximability") of a general function on a finite group $G$ to either of the sets $\operatorname{End}(G)$ and $\operatorname{Aff}(G)$, of group…