Related papers: The inverse problem of convex polygon coordinates
Conventional inverse optimization inputs a solution and finds the parameters of an optimization model that render a given solution optimal. The literature mostly focuses on inferring the objective function in linear problems when accepted…
A convex polyhedron, that is, a compact convex subset of $\mathbb{R}^3$ which is the intersection of finitely many closed half-spaces, can be rectified by taking the convex hull of the midpoints of the edges of the polyhedron. We derive…
The Weber problem consists of finding a point in $\mathbbm{R}^n$ that minimizes the weighted sum of distances from $m$ points in $\mathbbm{R}^n$ that are not collinear. An application that motivated this problem is the optimal location of…
It is known that for a variety of choices of metrics, including the standard bottleneck distance, the space of persistence diagrams admits geodesics. Typically these existence results produce geodesics that have the form of a convex…
Convex optimization problems arise naturally in quantum information theory, often in terms of minimizing a convex function over a convex subset of the space of hermitian matrices. In most cases, finding exact solutions to these problems is…
We consider the convex quadratic optimization problem with indicator variables and arbitrary constraints on the indicators. We show that a convex hull description of the associated mixed-integer set in an extended space with a quadratic…
In applications throughout science and engineering one is often faced with the challenge of solving an ill-posed inverse problem, where the number of available measurements is smaller than the dimension of the model to be estimated. However…
We present a geometrical analysis on the completely positive programming reformulation of quadratic optimization problems and its extension to polynomial optimization problems with a class of geometrically defined nonconvex conic programs…
We consider the space $P$ of generic complex 5-degree polynomials. Critical values of such polynomial, i.e. four points in the complex plane, either are vertices of a convex quadrangle $Q$, or vertices of a triangle $T$ with one point…
The inversion problem for rational B\'ezier curves is addressed by using resultant matrices for polynomials expressed in the Bernstein basis. The aim of the work is not to construct an inversion formula but finding the corresponding value…
A local convergence rate is established for a Gauss orthogonal collocation method applied to optimal control problems with control constraints. If the Hamiltonian possesses a strong convexity property, then the theory yields convergence for…
We propose a new shape-based modeling technique for applications in imaging problems. Given a collection of shape priors (a shape dictionary), we define our problem as choosing the right dictionary elements and geometrically composing them…
We prove global convergence of classical projection algorithms for feasibility problems involving union convex sets, which refer to sets expressible as the union of a finite number of closed convex sets. We present a unified strategy for…
We show that in complete metric spaces, $4$-hyperconvexity is equivalent to finite hyperconvexity. Moreover, every complete, almost $n$-hyperconvex metric space is $n$-hyperconvex. This generalizes among others results of Lindenstrauss and…
A convex subset X of a linear topological space is called compactly convex if there is a continuous compact-valued map $\Phi:X\to exp(X)$ such that $[x,y]\subset\Phi(x)\cup \Phi(y)$ for all $x,y\in X$. We prove that each convex subset of…
We propose an abstract definition of convex spaces as sets where one can take convex combinations in a consistent way. A priori, a convex space is an algebra over a finitary version of the Giry monad. We identify the corresponding Lawvere…
In the maximum independent set of convex polygons problem, we are given a set of $n$ convex polygons in the plane with the objective of selecting a maximum cardinality subset of non-overlapping polygons. Here we study a special case of the…
We propose a unifying setting for dealing with monodromically atypical intersections that goes beyond the usual Zilber-Pink conjecture. In particular we obtain a new proof of finiteness of the maximal atypical orbit closures in each stratum…
The isoperimetric problem asks for the maximum area of a region of given perimeter. It is natural to consider other measurements of a region, such as the diameter and width, and ask for the extreme value of one when another is fixed. The…
A convex partition of a point set P in the plane is a planar partition of the convex hull of P with empty convex polygons or internal faces whose extreme points belong to P. In a convex partition, the union of the internal faces give the…