相关论文: Optimal partitions for the sum and the maximum of …

Improvements in technology lead to increasing availability of large data sets which makes the need for data reduction and informative subsamples ever more important. In this paper we construct $ D $-optimal subsampling designs for…

We study the problems of covering or partitioning a polygon $P$ (possibly with holes) using a minimum number of small pieces, where a small piece is a connected sub-polygon contained in an axis-aligned unit square. For covering, we seek to…

Extremal optimization is a new general-purpose method for approximating solutions to hard optimization problems. We study the method in detail by way of the NP-hard graph partitioning problem. We discuss the scaling behavior of extremal…

We consider the classical minimum and maximum cut problems: find a partition of vertices of a graph into two disjoint subsets that minimize or maximize the sum of the weights of edges with endpoints in different subsets. It is known that if…

Here we introduce the concept of "optimal particles" for strong interactions with electromagnetic fields. We assume that a particle occupies a given electrically small volume in space and study the required optimal relations between the…

Many specific problems ranging from theoretical probability to applications in statistical physics, combinatorial optimization and communications can be formulated as an optimal tuning of local parameters in large systems of interacting…

We study the problem of high-dimensional covariance estimation under the constraint that the partial correlations are nonnegative. The sign constraints dramatically simplify estimation: the Gaussian maximum likelihood estimator is well…

We introduce a new approach aiming at computing approximate optimal designs for multivariate polynomial regressions on compact (semi-algebraic) design spaces. We use the moment-sum-of-squares hierarchy of semidefinite programming problems…

This article is devoted to the study of spectral optimisation for inhomogeneous plates. In particular, we optimise the first eigenvalue of a vibrating plate with respect to its thickness and/or density. Our result is threefold. First, we…

We study the real algebraic variety of real symmetric matrices with eigenvalue multiplicities determined by a partition. We present formulas for the dimension and Euclidean distance degree. We give a parametrization by rational functions.…

Recently, many authors have investigated how various partition statistics distribute as the size of the partition grows. In this work, we look at a particular statistic arising from the recent rejuvenation of MacMahon's partition analysis.…

Spectral clustering approaches have led to well-accepted algorithms for finding accurate clusters in a given dataset. However, their application to large-scale datasets has been hindered by computational complexity of eigenvalue…

We consider eigenvalue problems for general elliptic operators of arbitrary order subject to homogeneous boundary conditions on open subsets of the euclidean N-dimensional space. We prove stability results for the dependence of the…

In this paper, we provide three different ways to partition the polytope of doubly substochastic matrices into subpolytopes via the prescribed row and column sums, the sum of all elements and the sub-defect respectively. Then we…

We consider polynomials of a few linear forms and show how exploit this type of sparsity for optimization on some particular domains like the Euclidean sphere or a polytope. Moreover, a simple procedure allows to detect this form of…

Given a conformal action of a discrete group on a Riemann surface, we study the maximization of Laplace and Steklov eigenvalues within a conformal class, considering metrics invariant under the group action. We establish natural conditions…

We conduct a computational analysis of fair and optimal partitions in additively separable hedonic games. We show that, for strict preferences, a Pareto optimal partition can be found in polynomial time while verifying whether a given…

Neumann eigenvalues being non-decreasing with respect to domain inclusion, it makes sense to study the two shape optimization problems $\min\{\mu_k(\Omega):\Omega \mbox{ convex},\Omega \subset D, \}$ (for a given box $D$) and…

We consider spectral minimal partitions. Continuing work of the the present authors about problems for planar domains, [23], we focus on the sphere and obtain a sharp result for 3-partitions which is related to questions from harmonic…

In this note we derive a sharp concentration inequality for the supremum of a smooth random field over a finite dimensional set. It is shown that this supremum can be bounded with high probability by the value of the field at some…