Related papers: Duality between quasi-concave functions and monoto…

In this paper we consider quasi-concave set functions defined on antimatroids. There are many equivalent axiomatizations of antimatroids, that may be separated into two categories: antimatroids defined as set systems and antimatroids…

Classes of set functions along with a choice of ground set are a bedrock to determine and develop corresponding variants of greedy algorithms to obtain efficient solutions for combinatorial optimization problems. The class of approximate…

Submodular Functions are a special class of set functions, which generalize several information-theoretic quantities such as entropy and mutual information [1]. Submodular functions have subgradients and subdifferentials [2] and admit…

This paper presents a necessary and sufficient condition for a real-valued function defined on an open and convex subset of a Banach space to be quasi-concave, and a sufficient condition for such a function to be strictly quasi-concave.…

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…

In this paper, we study the approximation of an unknown quasiconcave function based on limited partial information. Available information includes lower bounds on the values of the target function at a specified set of points, as well as…

We introduce an expressive subclass of non-negative almost submodular set functions, called strongly 2-coverage functions which include coverage and (sums of) matroid rank functions, and prove that the homogenization of the generating…

Nearly convex sets play important roles in convex analysis, optimization and theory of monotone operators. We give a systematic study of nearly convex sets, and construct examples of subdifferentials of lower semicontinuous convex functions…

This paper provides an unique dual representation of set-valued lower semi-continuous quasiconvex and convex functions. The results are based on a duality result for increasing set valued functions.

We introduce the concept of quotient-convergence for sequences of submodular set functions, providing, among others, a new framework for the study of convergence of matroids through their rank functions. Extending the limit theory of…

Submodular functions are well-studied in combinatorial optimization, game theory and economics. The natural diminishing returns property makes them suitable for many applications. We study an extension of monotone submodular functions,…

In this paper we show that the negative sample distance covariance function is a quasi-concave set function of samples of random variables that are not statistically independent. We use these properties to propose greedy algorithms to…

Operator convex functions defined on the positive half-line play a prominent role in the theory of quantum information, where they are used to define quantum $f$-divergences. Such functions admit integral representations in terms of…

A class of real functions, which is the generalization of a family of convex functions, is introduced; in this connection, we have defined $X$-convex, strictly $X$-convex, quasi-$X$-convex, strictly quasi-$X$-convex, and semi-strictly…

In this paper, we extend the class of strongly $E$-preinvex and strongly $E$-invex functions to quasi strongly $E$-preinvex, quasi strongly $E$-invex and pseudo strongly $E$-invex functions. Some nontrivial suitable examples have been…

Decision maker's preferences are often captured by some choice functions which are used to rank prospects. In this paper, we consider ambiguity in choice functions over a multi-attribute prospect space. Our main result is a robust…

A real function $f$ is ward continuous if $f$ preserves quasi-Cauchyness, i.e. $(f(x_{n}))$ is a quasi-Cauchy sequence whenever $(x_{n})$ is quasi-Cauchy; and a subset $E$ of $\textbf{R}$ is quasi-Cauchy compact if any sequence…

In [arXiv 0811.3913] the authors introduced the notion of quasi-polynomial function as being a mapping f: X^n -> X defined and valued on a bounded chain X and which can be factorized as f(x_1,...,x_n)=p(phi(x_1),...,phi(x_n)), where p is a…

The most important open problem in Monotone Operator Theory concerns the maximal monotonicity of the sum of two maximally monotone operators provided that Rockafellar's constraint qualification holds. In this paper, we prove the maximal…

Seminal work by Edmonds and Lovasz shows the strong connection between submodularity and convexity. Submodular functions have tight modular lower bounds, and subdifferentials in a manner akin to convex functions. They also admit poly-time…