منابع مشابه
A greedy algorithm for convex geometries
Convex geometries are closure spaces which satisfy anti-exchange property, and they are known as dual of antimatroids. We consider functions defined on the sets of the extreme points of a convex geometry. Faigle– Kern (1996) presented a greedy algorithm to linear programming problems for shellings of posets, and Krüger (2000) introduced b-submodular functions and proved that Faigle–Kern’s algor...
متن کاملDual greedy polyhedra, choice functions, and abstract convex geometries
We consider a system of linear inequalities and its associated polyhedron for which we can maximize any linear objective function by /nding tight inequalities at an optimal solution in a greedy way. We call such a system of inequalities a dual greedy system and its associated polyhedron a dual greedy polyhedron. Such dual greedy systems have been considered by Faigle and Kern, and Kr1 uger for ...
متن کاملGreedy Strategies for Convex Optimization
We investigate two greedy strategies for finding an approximation to the minimum of a convex function E defined on a Hilbert space H. We prove convergence rates for these algorithms under suitable conditions on the objective function E. These conditions involve the behavior of the modulus of smoothness and the modulus of uniform convexity of E.
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملA Greedy Algorithm for Minimizing a Separable Convex Function over an Integral Bisubmodular Polyhedron
We present a new greedy algorithm for minimizing a separable convex function over an integral bisubmodular polyhedron. The algorithm starts with a.n arbitrary feasible solution and a current feasible solution incrementally moves toward an optimal one in a greedy way. \Ve also show that there exists at least one optimal solution in the coordinate-wise steepest descent direction from a feasible s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2003
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(02)00467-5