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

We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…

A partial matrix is a matrix where only some of the entries are given. We determine the maximum rank of the symmetric completions of a symmetric partial matrix where only the diagonal blocks are given and the minimum rank and the maximum…

In applications of linear algebra including nuclear physics and structural dynamics, there is a need to deal with uncertainty in the matrices. We focus on matrices that depend on a set of parameters $\omega$ and we are interested in the…

In continuation of \cite{HHOT}, we discuss the question of spectral minimal 3-partitions for the rectangle $]-\frac a2,\frac a2[\times ] -\frac b2,\frac b2[ $, with $0< a\leq b$. It has been observed in \cite{HHOT} that when $0<\frac ab <…

We consider the multiphase shape optimization problem $$\min\Big\{\sum_{i=1}^h\lambda_1(\Omega_i)+\alpha|\Omega_i|:\ \Omega_i\ \hbox{open},\ \Omega_i\subset D,\ \Omega_i\cap\Omega_j=\emptyset\Big\},$$ where $\alpha>0$ is a given constant…

In this work, we study the problem of monotone non-submodular maximization with partition matroid constraint. Although a generalization of this problem has been studied in literature, our work focuses on leveraging properties of partition…

We consider the problem of finding optimally stable polynomial approximations to the exponential for application to one-step integration of initial value ordinary and partial differential equations. The objective is to find the largest…

Maximum bipartite matching is a fundamental algorithmic problem which can be solved in polynomial time. We consider a natural variant in which there is a separation constraint: the vertices on one side lie on a path or a grid, and two…

In many applications such as web-based search, document summarization, facility location and other applications, the results are preferable to be both representative and diversified subsets of documents. The goal of this study is to select…

Our research deals with the optimization version of the set partition problem, where the objective is to minimize the absolute difference between the sums of the two disjoint partitions. Although this problem is known to be NP-hard and…

In this talk we show that any spherically symmetric spacetime admits locally a maximal spacelike slicing. The above condition is reduced to solve a decoupled system of first order quasi-linear partial differential equations. The solution…

We explicitly evaluate the principal eigenvalue of the extremal Pucci's sup--operator for a class of special plane domains, and we prove that, for fixed area, the eigenvalue is minimal for the most symmetric set.

We introduce three quantities called total coherence, total volume, and nuclear energy, and we show that equiangular Parseval frames maximize all three of these quantities over the set of all Parseval frames. We then show that equiangular…

We discuss the notion of optimal polynomial approximants in multivariable reproducing kernel Hilbert spaces. In particular, we analyze difficulties that arise in the multivariable case which are not present in one variable, for example, a…

Let G be a compact group acting in a real vector space V. We obtain a number of inequalities relating the L^infinity norm of a matrix element of the representation of G with its L^p norm for p<infinity. We apply our results to obtain…

In combinatorial optimization, partial variable assignments are called persistent if they agree with some optimal solution. We propose persistency criteria for the multicut and max-cut problem as well as fast combinatorial routines to…

We consider the following geometric optimization problem: find a maximum-area rectangle and a maximum-perimeter rectangle contained in a given convex polygon with $n$ vertices. We give exact algorithms that solve these problems in time…

We develop a computational method for extremal Steklov eigenvalue problems and apply it to study the problem of maximizing the $p$-th Steklov eigenvalue as a function of the domain with a volume constraint. In contrast to the optimal…

We present some open problems and obtain some partial results for spectral optimization problems involving measure, torsional rigidity and first Dirichlet eigenvalue.

We study the problem of optimizing nonlinear objective functions over bipartite matchings. While the problem is generally intractable, we provide several efficient algorithms for it, including a deterministic algorithm for maximizing convex…