Convexity and Steinitz's Exchange Property

نویسنده

  • Kazuo Murota
چکیده

Convex analysis” is developed for functions defined on integer lattice points. We investigate the class of functions which enjoy a variant of Steinitz’s exchange property. It includes linear functions on matroids, valuations on matroids (in the sense of Dress and Wenzel), and separable concave functions on the integral base polytope of submodular systems. It is shown that a function ω has the Steinitz exchange property if and only if it can be extended to a concave function ω such that the maximizers of (ω+any linear function) form an integral base polytope. A Fenchel-type min-max theorem and discrete separation theorems are established which imply, as immediate consequences, Frank’s discrete separation theorem for submodular functions, Edmonds’ intersection theorem, Fujishige’s Fencheltype min-max theorem for submodular functions, and also Frank’s weight splitting theorem for weighted matroid intersection.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A full NT-step O(n) infeasible interior-point method for Cartesian P_*(k) –HLCP over symmetric cones using exponential convexity

In this paper, by using the exponential convexity property of a barrier function, we propose an infeasible interior-point method for Cartesian P_*(k) horizontal linear complementarity problem over symmetric cones. The method uses Nesterov and Todd full steps, and we prove that the proposed algorithm is well define. The iteration bound coincides with the currently best iteration bound for the Ca...

متن کامل

The asymptotic convexity of the negative likelihood function of GARCH models

We prove the convexity of the negative likelihood function in the asymptotic sense for GARCH models. This property provides assurance for the convergence of numerical optimization algorithms for maximum likelihood estimation of GARCH.A simulation study is conducted in order to compare the performance of several different iteration algorithms. An example based on the log-returns of foreign excha...

متن کامل

Some Properties of B-convexity

In this paper, we give a characteristic of B-convexity structures of finite dimensional B-spaces: if a finite dimensional B-space has the weak selection property then its B-convexity structure satisfies H-condition. We also get some relationships among B-convexity structures, selection property and fixed point property. We show that in a compact convex subset of a finite dimensional B-space sat...

متن کامل

Antimatroids, Betweenness, Convexity

Korte and Lovász [12, 13] founded the theory of greedoids . These combinatorial structures characterize a class of optimization problems that can be solved by greedy algorithms. In particular, greedoids generalize matroids , introduced earlier by Whitney [16]. Antimatroids , introduced by Dilworth [3] as particular examples of semimodular lattices, make up another class of greedoids. Antimatroi...

متن کامل

The Loop Shortening Property and Almost Convexity

We introduce the loop shortening property and the basepoint loop shortening property for finitely generated groups, and examine their relation to quadratic isoperimetric functions and almost convexity.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996