منابع مشابه
Quasi-concave Programming Quasi-concave Programming
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملQuasi-Concave Density Estimation
Maximum likelihood estimation of a log-concave probability density is formulated as a convex optimization problem and shown to have an equivalent dual formulation as a constrained maximum Shannon entropy problem. Closely related maximum Renyi entropy estimators that impose weaker concavity restrictions on the fitted density are also considered, notably a minimum Hellinger discrepancy estimator ...
متن کاملQuasi-concave functions on antimatroids
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 defined as languages. An algorthmic characterization of antimatroids, that considers them as set systems, was given in [4]. This characterization is based on the i...
متن کاملQuasi-Concave Functions and Greedy Algorithms
Many combinatorial optimization problems can be formulated as: for a given set system over E (i.e., for a pair (E, ) where ⊆ 2E is a family of feasible subsets of finite set E), and for a given function F : →R, find an element of for which the value of the function F is minimum or maximum. In general, this optimization problem is NP-hard, but for some specific functions and set systems the prob...
متن کاملQuasi-concave functions on meet-semilattices
This paper deals with maximization of set f'unctions delined as minimum values of monotone linkage functions. In previous research, it has been shown that such a set function can be maximized by a greedy type algorithm over a family of all subsets of a finite set. ln this paper, we extend this finding to meet-semilattices. We show that the class of functions defined as minimum values of monoton...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2015
ISSN: 1556-5068
DOI: 10.2139/ssrn.2645925