Related papers: Complete positivity and distance-avoiding sets
In this paper, we focus on the decentralized composite optimization for convex functions. Because of advantages such as robust to the network and no communication bottle-neck in the central server, the decentralized optimization has…
We study some methods of subgradient projections for solving a convex feasibility problem with general (not necessarily hyperplanes or half-spaces) convex sets in the inconsistent case and propose a strategy that controls the relaxation…
Convex optimization problems arising in applications often have favorable objective functions and complicated constraints, thereby precluding first-order methods from being immediately applicable. We describe an approach that exchanges the…
We consider the space of real-valued continuously differentiable functions on a compact subset of a euclidean space. We characterize the completeness of this space and prove that the space of restrictions of continuously differentiable…
Submodular set-functions have many applications in combinatorial optimization, as they can be minimized and approximately maximized in polynomial time. A key element in many of the algorithms and analyses is the possibility of extending the…
This article is devoted to the study of classical and new results concerning equidistant sets, both from the topological and metric point of view. We start with a review of the most interesting known facts about these sets in the euclidean…
The concept of distance rationalizability of social choice rules has been explored in recent years by several authors. We deal here with several foundational questions, and unify, correct, and generalize previous work. For example, we study…
We identity the optimal non-infinitesimal direction of descent for a convex function. An algorithm is developed that can theoretically minimize a subset of (non-convex) functions.
The (constrained) minimization of a ratio of set functions is a problem frequently occurring in clustering and community detection. As these optimization problems are typically NP-hard, one uses convex or spectral relaxations in practice.…
This article studies problems of optimal transport, by embedding them in a general functional analytic framework of convex optimization. This provides a unified treatment of a large class of related problems in probability theory and allows…
A convex optimization problem in conic form involves minimizing a linear functional over the intersection of a convex cone and an affine subspace. In some cases, it is possible to replace a conic formulation using a certain cone, with a…
We study max-plus convexity in an Archimedean Riesz space $E$ with an order unit $\un$; the definition of max-plus convex sets is algebraic and we do not assume that $E$ has an {\it a priori} given topological structure. To the given unit…
Functions with uniform level sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used, e.g., in multicriteria optimization, decision theory, mathematical…
A finite subset $X$ of the Euclidean space is called an $m$-distance set if the number of distances between two distinct points in $X$ is equal to $m$. An $m$-distance set $X$ is said to be maximal if any vector cannot be added to $X$ while…
In this paper, we focus on the following general shape optimization problem: $$ \min\{J(\Om), \Om convex, \Om\in\mathcal S_{ad}\}, $$ where $\mathcal S_{ad}$ is a set of 2-dimensional admissible shapes and $J:\mathcal{S}_{ad}\to\R$ is a…
The effectiveness of Symmetric Positive Definite (SPD) manifold features has been proven in various computer vision tasks. However, due to the non-Euclidean geometry of these features, existing Euclidean machineries cannot be directly used.…
We consider so-called branched transport and variants thereof in two space dimensions. In these models one seeks an optimal transportation network for a given mass transportation task. In two space dimensions, they are closely connected to…
A convex cone is homogeneous if its automorphism group acts transitively on the interior of the cone, i.e., for every pair of points in the interior of the cone, there exists a cone automorphism that maps one point to the other. Cones that…
In this short note we consider an unconventional overdetermined problem for the torsion function: let $n\geq 2$ and $\Omega$ be a bounded open set in $\mathbb{R}^n$ whose torsion function $u$ (i.e. the solution to $\Delta u=-1$ in $\Omega$,…
This paper is concerned with existence and qualitative properties of positive solutions of semilinear elliptic equations in bounded domains with Dirichlet boundary conditions. We show the existence of positive solutions in the vicinity of…