相关论文: Automatic convexity

Let $S$ be a convex hypersurface (the boundary of a closed convex set $V$ with nonempty interior) in $\mathbb{R}^n$. We prove that $S$ contains no lines if and only if for every open set $U\supset S$ there exists a real-analytic convex…

Qualification conditions (also termed constraint qualifications) help avoid pathological behavior at domain boundaries in convex analysis. By generalizing facial reduction from conic programming to general convex programs of the form $f(x)…

We present a mathematical and algorithmic scheme for learning the principal geometric elements in an image or 3D object. We build on recent work that convexifies the basic problem of finding a combination of a small number shapes that…

In this work, we present a new efficient method for convex shape representation, which is regardless of the dimension of the concerned objects, using level-set approaches. Convexity prior is very useful for object completion in computer…

A well-known result in the study of convex polyhedra, due to Minkowski, is that a convex polyhedron is uniquely determined (up to translation) by the directions and areas of its faces. The theorem guarantees existence of the polyhedron…

Segmenting an image into multiple components is a central task in computer vision. In many practical scenarios, prior knowledge about plausible components is available. Incorporating such prior knowledge into models and algorithms for image…

The higher-rank numerical range is a convex compact set generalizing the classical numerical range of a square complex matrix, first appearing in the study of quantum error correction. We will discuss some of the real algebraic and convex…

We prove that for two-component maps in dimension two, rank-one convexity is equivalent to quasiconvexity. The essential tool for the proof is a fixed-point argument for a suitable set-valued map going from one component to the other that…

For many applications, we need to use techniques to represent convex shapes and objects. In this work, we use level set method to represent shapes and find a necessary and sufficient condition on the level set function to guarantee the…

A convex geometry is a closure system satisfying the anti-exchange property. This paper, following the work of K. Adaricheva and M. Bolat (2016) and the Polymath REU 2020 team, continues to investigate representations of convex geometries…

Sweeping is a powerful and versatile method of designing objects. Boundary of volumes (henceforth envelope) obtained by sweeping solids have been extensively investigated in the past, though, obtaining an accurate parametrization of the…

We study how the supporting hyperplanes produced by the projection process can complement the method of alternating projections and its variants for the convex set intersection problem. For the problem of finding the closest point in the…

An algorithm which computes a solution of a set optimization problem is provided. The graph of the objective map is assumed to be given by finitely many linear inequalities. A solution is understood to be a set of points in the domain…

Results on matrix canonical forms are used to give a complete description of the higher rank numerical range of matrices arising from the study of quantum error correction. It is shown that the set can be obtained as the intersection of…

Given a set of radii measured from a fixed point, the existence of a convex configuration with respect to the set of distinct radii in the two-dimensional case is proved when radii are distinct or repeated at most four points. However, we…

We display four approximation theorems for manifold-valued mappings. The first one approximates holomorphic embeddings on pseudoconvex domains in $\Bbb C^n$ with holomorphic embeddings with dense images. The second theorem approximates…

This paper gives some relating results for various concepts of convexity in metric spaces such as midpoint convexity, convex structure, uniform convexity and near-uniform convexity, Busemann curvature and its relation to convexity. Some…

This work proposes a new formulation to the long-standing problem of convex decomposition through learning feature fields, enabling the first feed-forward model for open-world convex decomposition. Our method produces high-quality…

A set is star-shaped if there is a point in the set that can see every other point in the set in the sense that the line-segment connecting the points lies within the set. We show that testing whether a non-empty compact smooth region is…

In the setting of CAT(k) spaces, common fixed point iterations built from prox mappings (e.g. prox-prox, Krasnoselsky-Mann relaxations, nonlinear projected-gradients) converge locally linearly under the assumption of linear metric…