Related papers: Variational problems on product spaces Different o…
In this paper, we generalize the chance optimization problems and introduce constrained volume optimization where enables us to obtain convex formulation for challenging problems in systems and control. We show that many different problems…
Iterative projection methods may become trapped at non-solutions when the constraint sets are nonconvex. Two kinds of parameters are available to help avoid this behavior and this study gives examples of both. The first kind of parameter,…
Variable or value elimination in a constraint satisfaction problem (CSP) can be used in preprocessing or during search to reduce search space size. A variable elimination rule (value elimination rule) allows the polynomial-time…
This work considers a number of optimization problems and reductive relations between them. The two main problems we are interested in are the \emph{Optimal Decision Tree} and \emph{Set Cover}. We study these two fundamental tasks under…
Given a non-negative $n \times n$ matrix viewed as a set of distances between $n$ points, we consider the property testing problem of deciding if it is a metric. We also consider the same problem for two special classes of metrics, tree…
Let us consider the autonomous obstacle problem \begin{equation*} \min_v \int_\Omega F(Dv(x)) \, dx \end{equation*} on a specific class of admissible functions, where we suppose the Lagrangian satisfies proper hypotheses of convexity and…
We give a selection of major open problems involving selective properties, diagonalizations, and covering properties for sets of real numbers. This is a revision of the version published as a chapter in the book \textbf{Open Problems in…
This paper studies lower bounds for fundamental optimization problems in the CONGEST model. We show that solving problems exactly in this model can be a hard task, by providing $\tilde{\Omega}(n^2)$ lower bounds for cornerstone problems,…
This paper deals with the problem of measurable lifting modification for stochastic processes in its most general form and with the 'product lifting problem'. Solutions to the positive are reduced to the existence of marginals with respect…
We study the double bubble problem with perimeter taken with respect to the $\ell_1$ norm on $\mathbb{R}^2$. We give an elementary proof for the existence of minimizing sets for any volume ratio parameter $0<\alpha\le1$ by direct comparison…
We consider a variant of the set covering problem with uncertain parameters, which we refer to as the chance-constrained set multicover problem (CC-SMCP). In this problem, we assume that there is uncertainty regarding whether a selected set…
The purpose of this paper is twofold. First, we provide an optimal $\Omega(\sqrt{n})$ bits lower bound for any two-way protocol for the Vector in Subspace Communication Problem which is of bounded total rank. This result complements Raz's…
In this paper we show that any increasing functional of the first k eigenvalues of the Dirichlet Laplacian admits a (quasi-)open minimizer among the subsets of R^N of unit measure. In particular, there exists such a minimizer which is…
Given a locally compact, complete metric space $({\rm X},{\sf D})$ and an open set $\Omega\subseteq{\rm X}$, we study the class of length distances $\sf d$ on $\Omega$ that are bounded from above and below by fixed multiples of the ambient…
Finite obstruction sets for lower ideals in the minor order are guaranteed to exist by the Graph Minor Theorem. It has been known for several years that, in principle, obstruction sets can be mechanically computed for most natural lower…
Obtaining guarantees on the convergence of the minimizers of empirical risks to the ones of the true risk is a fundamental matter in statistical learning. Instead of deriving guarantees on the usual estimation error, the goal of this paper…
Implicit variables of an optimization problem are used to model variationally challenging feasibility conditions in a tractable way while not entering the objective function. Hence, it is a standard approach to treat implicit variables as…
We study existence, structure, uniqueness and regularity of solutions of the obstacle problem \begin{equation*} \inf_{u\in BV_f(\Omega)}\int_{\mathbb{R}^n}\phi(x,Du), \end{equation*} where $BV_f(\Omega)=\{u\in BV(\Omega): u\geq \psi \text{…
The paper is concerned with a free boundary problem generated by the biharmonic operator and an obstacle. The main goal is to deduce a fully guaranteed upper bound of the difference between the exact minimizer u and any function…
We study randomized algorithms for constrained optimization, in abstract frameworks that include, in strictly increasing generality: convex programming; LP-type problems; violator spaces; and a setting we introduce, consistent spaces. Such…