Related papers: Qualitative Properties of $k-$Center Problems
This paper deals with a method for the approximation of a spectral density function among the solutions of a generalized moment problem a` la Byrnes/Georgiou/Lindquist. The approximation is pursued with respect to the Kullback-Leibler…
A classical inequality by Gr\"unbaum provides a sharp lower bound for the ratio $\mathrm{vol}(K^{-})/\mathrm{vol}(K)$, where $K^{-}$ denotes the intersection of a convex body with non-empty interior $K\subset\mathbb{R}^n$ with a halfspace…
Given a set of points in a metric space, the $(k,z)$-clustering problem consists of finding a set of $k$ points called centers, such that the sum of distances raised to the power of $z$ of every data point to its closest center is…
The generalized problem of moments is a conic linear optimization problem over the convex cone of positive Borel measures with given support. It has a large variety of applications, including global optimization of polynomials and rational…
We discuss the optimization problem for minimizing the $(n-1)$-volume of the intersection of a convex cone $K$ in $\Bbb R^n$ with a hyperplane through a given point, first considered in \cite{We}. We give a geometric characterization of the…
We consider a variant of the $k$-center clustering problem in $\Re^d$, where the centers can be divided into two subsets, one, the red centers of size $p$, and the other, the blue centers of size $q$, where $p+q=k$, and such that each red…
Many works on inverse problems in the imaging sciences consider regularization via one or more penalty functions or constraint sets. When the models/images are not easily described using one or a few penalty functions/constraints, additive…
Consider a convex function that is invariant under an group of transformations. If it has a minimizer, does it also have an invariant minimizer? Variants of this problem appear in nonparametric statistics and in a number of adjacent fields.…
We consider the classic $k$-center problem {in the constant dimensional Euclidean space} under a parallel setting, on the low-local-space Massively Parallel Computation (MPC) model, with local space per machine of ${O}(n^{\delta})$, where…
We investigate the 2-center problem for arbitrary strictly convex, centrally symmetric curves instead of usual circles. In other words, we extend the 2-center problem (from the Euclidean plane) to strictly convex normed planes, since any…
We give a simple and natural method for computing approximately optimal solutions for minimizing a convex function $f$ over a convex set $K$ given by a separation oracle. Our method utilizes the Frank--Wolfe algorithm over the cone of valid…
In this paper, we obtain new results related to Minkowski fractional integral inequality using generalized k-fractional integral operator which is in terms of the Gauss hypergeometric function.
This article derives closed-form parametric formulas for the Minkowski sums of convex bodies in d-dimensional Euclidean space with boundaries that are smooth and have all positive sectional curvatures at every point. Under these conditions,…
Given a real number $q$ and a star body in the $n$-dimensional Euclidean space, the generalized dual curvature measure of a convex body was introduced by Lutwak-Yang-Zhang [43]. The corresponding generalized dual Minkowski problem is…
This paper considers the problem of solving a special quartic-quadratic optimization problem with a single sphere constraint, namely, finding a global and local minimizer of…
We develop geometry of algebraic subvarieties of $K^{n}$ over arbitrary Henselian valued fields $K$. This is a continuation of our previous article concerned with algebraic geometry over rank one valued fields. At the center of our approach…
We formulate an isoperimetric deformation of curves on the Minkowski plane, which is governed by the defocusing mKdV equation. Two classes of exact solutions to the defocusing mKdV equation are also presented in terms of the $\tau$…
Let $m\in\mathbb{N},$ $m\geq 2,$ and let $\{p_j\}_{j=1}^m$ be a finite subset of $\mathbb{S}^2$ such that $0\in\mathbb{R}^3$ lies in its positive convex hull. In this paper we make use of the classical Minkowski problem, to show the…
In this paper, we study the Dvoretzky covering problem with non-uniformly distributed centers. When the probability law of the centers admits an absolutely continuous density which satisfies a regular condition on the set of essential…
Centroid based clustering methods such as k-means, k-medoids and k-centers are heavily applied as a go-to tool in exploratory data analysis. In many cases, those methods are used to obtain representative centroids of the data manifold for…