相关论文: Quasi-concave functions on antimatroids

Submodular functions describe a variety of discrete problems in machine learning, signal processing, and computer vision. However, minimizing submodular functions poses a number of algorithmic challenges. Recent work introduced an…

The problem of maximizing non-negative submodular functions has been studied extensively in the last few years. However, most papers consider submodular set functions. Recently, several advances have been made for the more general case of…

We show weak lower semi-continuity of functionals assuming the new notion of a "convexly constrained" $\mathcal A$-quasiconvex integrand. We assume $\mathcal A$-quasiconvexity only for functions defined on a set $K$ which is convex.…

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…

Rough sets are efficient for data pre-process in data mining. Lower and upper approximations are two core concepts of rough sets. This paper studies generalized rough sets based on symmetric and transitive relations from the…

The maximization of submodular functions have found widespread application in areas such as machine learning, combinatorial optimization, and economics, where practitioners often wish to enforce various constraints; the matroid constraint…

The paper studies complementary choice functions, i.e. monotonic and consistent choice functions. Such choice functions were introduced and used in the work \cite{RY} for investigation of matchings with complementary contracts. Three…

Set functions with convenient properties (such as submodularity) appear in application areas of current interest, such as algorithmic game theory, and allow for improved optimization algorithms. It is natural to ask (e.g., in the context of…

Rough sets are efficient for data pre-processing in data mining. Matroids are based on linear algebra and graph theory, and have a variety of applications in many fields. Both rough sets and matroids are closely related to lattices. For a…

This is a survey about certain "almost homomorphisms" and "almost linear" functionals (called quasi-morphisms and quasi-states) in symplectic topology and their applications to Hamiltonian dynamics, functional-theoretic properties of…

We obtain a complete description of the Riesz measures of almost periodic subharmonic functions with at most of linear growth on the complex plane; as a consequence we get a complete description of zero sets for the class of entire…

In this paper the spherical quasi-convexity of quadratic functions on spherically convex sets is studied. Several conditions characterizing the spherical quasi-convexity of quadratic functions are presented. In particular, conditions…

In this paper, we introduce the concept of nearly convex set-valued mappings and investigate fundamental properties of these mappings. Additionally, we establish a geometric approach for generalized differentiation of nearly convex…

Submodular function maximization has found a wealth of new applications in machine learning models during the past years. The related supermodular maximization models (submodular minimization) also offer an abundance of applications, but…

Submodular continuous functions are a category of (generally) non-convex/non-concave functions with a wide spectrum of applications. We characterize these functions and demonstrate that they can be maximized efficiently with approximation…

Rough sets were proposed to deal with the vagueness and incompleteness of knowledge in information systems. There are may optimization issues in this field such as attribute reduction. Matroids generalized from matrices are widely used in…

In this article, we deal with several notions in dynamical systems. Firstly, we prove that both closure function and orbital function are idempotent on set-valued dynamical systems. And we show that the compact limit set of a connected set…

We describe a combinatorial algorithm which, given a monotone and consistent symmetric set function d on a finite set V in the sense of Rizzi, constructs a non trivial set S minimizing d(S,V-S). This includes the possibility for the…

Contact has been well established as an important quantity to govern dilute quantum systems, in which the pairwise correlation at short distance traces a broad range of thermodynamic properties. So far, studies have been focusing on contact…

This paper has two goals: to present some new results that are necessary for further study and applications of quasi-linear functionals, and, by combining known and new results, to serve as a convenient single source for anyone interested…