相关论文: Automatic convexity
We prove completeness of preferential conditional logic with respect to convexity over finite sets of points in the Euclidean plane. A conditional is defined to be true in a finite set of points if all extreme points of the set interpreting…
A trisection of a smooth, closed, oriented 4-manifold is a decomposition into three 4-dimensional 1-handlebodies meeting pairwise in 3-dimensional 1-handlebodies, with triple intersection a closed surface. The fundamental groups of the…
Automatic face recognition is a research area with high popularity. Many different face recognition algorithms have been proposed in the last thirty years of intensive research in the field. With the popularity of deep learning and its…
A key idea in convex optimization theory is to use well-structured affine functions to approximate general functions, leading to impactful developments in conjugate functions and convex duality theory. This raises the question: what are the…
We combine Freedman's topology with Eliashberg's holomorphic theory to construct Stein neighborhood systems in complex surfaces, and use these to study various notions of convexity and concavity. Every tame, topologically embedded 2-complex…
We provide sufficient conditions for two subgroups of a hierarchically hyperbolic group to generate an amalgamated free product over their intersection. The result applies in particular to certain geometric subgroups of mapping class groups…
We study the problem of asymptotic consensus as it occurs in a wide range of applications in both man-made and natural systems. In particular, we study systems with directed communication graphs that may change over time. We recently…
This article shows the existence of a class of closed bounded matrix convex sets which do not have absolute extreme points. The sets we consider are noncommutative sets, $K_X$, formed by taking matrix convex combinations of a single tuple…
The inverse problem of diffraction theory in essence amounts to the reconstruction of the atomic positions of a solid from its diffraction image. From a mathematical perspective, this is a notoriously difficult problem, even in the…
In this paper, we discuss an efficient algorithm for computing the growth distance between two compact convex sets with representable support functions. The growth distance between two sets is the minimum scaling factor such that the sets…
This paper presents a method that improve state-of-the-art of the concave point detection methods as a first step to segment overlapping objects on images. It is based on the analysis of the curvature of the objects contour. The method has…
The implicit convex feasibility problem attempts to find a point in the intersection of a finite family of convex sets, some of which are not explicitly determined but may vary. We develop simultaneous and sequential projection methods…
In this work, we reveal a rich combinatorial structure underlying exact minimax optimal algorithms for classical nonexpansive fixed-point problems. This viewpoint unifies all extremal optimal methods and provides a systematic and practical…
This research provides algorithms and numerical methods to geometrically control the magnitude of the internal and external forces in the reciprocal diagrams of 3D/Polyhedral Graphic statics (3DGS). In 3DGS, the form of the structure and…
A theorem of Tietze and Nakamija, from 1928, asserts that if a subset X of R^n is closed, connected, and locally convex, then it is convex. We give an analogous "local to global convexity" theorem when the inclusion map of X to R^n is…
Developing a reliable and practical face recognition system is a long-standing goal in computer vision research. Existing literature suggests that pixel-wise face alignment is the key to achieve high-accuracy face recognition. By assuming a…
The purpose of this paper is to propose and analyze a multi-step iterative algorithm to solve a convex optimization problem and a fixed point problem posed on a Hadamard space. The convergence properties of the proposed algorithm are…
We obtain an upper bound for the volume of the convex hull of a simple closed Frenet curve with exactly four vertices, i.e., four points of vanishing torsion, and lying on the boundary of its convex hull. Moreover, we show that the upper…
Many problems of theoretical and practical interest involve finding an optimum over a family of convex functions. For instance, finding the projection on the convex functions in $H^k(\Omega)$, and optimizing functionals arising from some…
The traditional view in numerical conformal mapping is that once the boundary correspondence function has been found, the map and its inverse can be evaluated by contour integrals. We propose that it is much simpler, and 10-1000 times…