Related papers: Area Minimizing Sets Subject to a Volume Constrain…
We study two principle minimizing problems, subject of different constraints. Our open sets are assumed bounded, except mentioning otherwise;precisely $\Omega=]0,1[^n \in {\mathbb{R}}^n , n=1 $ or $n=2$.
We advocate an optimization procedure for variable density sampling in the context of compressed sensing. In this perspective, we introduce a minimization problem for the coherence between the sparsity and sensing bases, whose solution…
Consider a sum of convex functions, where the only information known about each individual summand is the location of a minimizer. In this work, we give an exact characterization of the set of possible minimizers of the sum. Our results…
We consider a generalization of the hyperplane problem to arbitrary measures in place of volume and to sections of lower dimensions. We prove this generalization for unconditional convex bodies and for duals of bodies with bounded volume…
We prove a lower bound on the number of the convex components of a compact set with non-empty interior in $\mathbb{R}^n$ for all $n\ge2$. Our result generalizes and improves the inequalities previously obtained in M. Carozza, F. Giannetti,…
It is a well known fact that in $\mathbb{R}^n$ a subset of minimal perimeter $L$ among all sets of a given volume is also a set of maximal volume among all sets of the same perimeter $L$. This is called the reciprocity principle for…
We provide a solution method for the polyhedral convex set optimization problem, that is, the problem to minimize a set-valued mapping with polyhedral convex graph with respect to a set ordering relation which is generated by a polyhedral…
We consider the problem of minimal correction of the training set to make it consistent with monotonic constraints. This problem arises during analysis of data sets via techniques that require monotone data. We show that this problem is…
We present the viewpoint that optimization problems encountered in machine learning can often be interpreted as minimizing a convex functional over a function space, but with a non-convex constraint set introduced by model parameterization.…
We prove some uniqueness results for conics of minimal area that enclose a compact, full-dimensional subset of the elliptic plane. The minimal enclosing conic is unique if its center or axes are prescribed. Moreover, we provide sufficient…
We address the problem of one dimensional segment detection and estimation, in a regression setup. At each point of a fixed or random design, one observes whether that point belongs to the unknown segment or not, up to some additional…
We study a specific convex maximization problem in n-dimensional space. The conjectured solution is proved to be a vertex of the polyhedral feasible region, but only a partial proof of local maximality is known. Integer sequences with…
In this manuscript we study the following optimization problem with volume constraint: \[ \min\left\{\frac{1}{p}\int_{\Omega} |\nabla v|^pdx- \int_{\partial \Omega} gv\,dS \colon v \in W^{1, p} \left(\Omega\right), \text{ and } |\{v>0\}|…
The 2-sets convex feasibility problem aims at finding a point in the intersection of two closed convex sets $A$ and $B$ in a normed space $X$. More generally, we can consider the problem of finding (if possible) two points in $A$ and $B$,…
We show that the minimum distance projection in the L1-norm from an interior point onto the boundary of a convex set is achieved by a single, unidimensional projection. Application of this characterization when the convex set is a…
Recent developments in set optimization are surveyed and extended including various set relations as well as fundamental constructions of a convex analysis for set- and vector-valued functions, and duality for set optimization problems.…
We consider the problem of minimizing convex combinations of the first two eigenvalues of the Dirichlet-Laplacian among open sets of $R^N$ of fixed measure. We show that, by purely elementary arguments, based on the minimality condition, it…
Motivated by conjectures of Mahler and Makai Jr., we study bounds on the volume of a convex body in terms of the successive minima of its polar body.
We study the infimum of the renormalized volume for convex-cocompact hyperbolic manifolds, as well as describing how a sequence converging to such values behaves. In particular, we show that the renormalized volume is continuous under the…
We consider the problem of minimizing the relative perimeter under a volume constraint in an unbounded convex body $C\subset \mathbb{R}^{n+1}$, without assuming any further regularity on the boundary of $C$. Motivated by an example of an…