相关论文: Pruning Processes and a New Characterization of Co…

We introduce a notion of $k$-convexity and explore polygons in the plane that have this property. Polygons which are \mbox{$k$-convex} can be triangulated with fast yet simple algorithms. However, recognizing them in general is a 3SUM-hard…

This paper studies system theoretic properties of the class of difference inclusions of convex processes. We will develop a framework considering eigenvalues and eigenvectors, weakly and strongly invariant cones, and a decomposition of…

The paper introduces the first formulation of convex Q-learning for Markov decision processes with function approximation. The algorithms and theory rest on a relaxation of a dual of Manne's celebrated linear programming characterization of…

In this study, a geometric version of an NP-hard problem ("Almost $2-SAT$" problem) is introduced which has potential applications in clustering, separation axis, binary sensor networks, shape separation, image processing, etc. Furthermore,…

Building sets were introduced in the study of wonderful compactifications of hyperplane arrangement complements and were later generalized to finite meet-semilattices. Convex geometries, the duals of antimatroids, offer a robust…

This paper studies hidden convexity properties associated with constrained optimization problems over the set of rotation matrices $\text{SO}(n)$. Such problems are nonconvex due to the constraint $X \in \text{SO}(n)$. Nonetheless, we show…

In this manuscript, we study the statistical properties of convex clustering. We establish that convex clustering is closely related to single linkage hierarchical clustering and $k$-means clustering. In addition, we derive the range of…

For those acquainted with CVX (aka disciplined convex programming) of M. Grant and S. Boyd, the motivation of this work is the desire to extend the scope of CVX beyond convex minimization -- to convex-concave saddle point problems and…

Some properties of solutions of convex sweeping processes with velocity constraints are studied in this paper. Namely, the solution sensitivity with respect to the initial value, the boundedness, the closedness, and the convexity of the…

Convex Integration is a theory developed in the '70s by M. Gromov. This theory allows to solve families of differential problems satisfying some convex assumptions. From a subsolution, the theory iteratively builds a solution by applying a…

In this Letter we suggest a method of convex rigid frames in the studies of the multipartite quNit pure-states. We illustrate what are the convex rigid frames and what is the method of convex rigid frames. As the applications we use this…

We review several (and provide new) results on the theory of moments, sums of squares and basic semi-algebraic sets when convexity is present. In particular, we show that under convexity, the hierarchy of semidefinite relaxations for…

In [G. Bianchi, R. J. Gardner and P. Gronchi, Symmetrization in Geometry, Adv. Math., vol. 306 (2017), 51-88], a systematic study of symmetrization operators on convex sets and their properties is conducted. In the end of their article, the…

In his work on log-concavity of multiplicities, Okounkov showed in passing that one could associate a convex body to a linear series on a projective variety, and then use convex geometry to study such linear systems. Although Okounkov was…

Multivariate Analysis (MVA) comprises a family of well-known methods for feature extraction that exploit correlations among input variables of the data representation. One important property that is enjoyed by most such methods is…

We study multivariate normal models that are described by linear constraints on the inverse of the covariance matrix. Maximum likelihood estimation for such models leads to the problem of maximizing the determinant function over a…

The concept of an $i$-symmetrization is introduced, which provides a convenient framework for most of the familiar symmetrization processes on convex sets. Various properties of $i$-symmetrizations are introduced and the relations between…

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 develop techniques to convexify a set that is invariant under permutation and/or change of sign of variables and discuss applications of these results. First, we convexify the intersection of the unit ball of a permutation and…

Tree convex sets refer to a collection of sets such that each set in the collection is a subtree of a tree whose nodes are the elements of these sets. They extend the concept of row convex sets each of which is an interval over a total…