Abstract.
We present a polynomial time scaling algorithm for the minimization of an M-convex function. M-convex functions are nonlinear discrete functions with (poly)matroid structures, which are being recognized as playing a fundamental role in tractable cases of discrete optimization. The algorithm is applicable also to a variant of quasi M-convex functions.
Similar content being viewed by others
References
Cunningham, W. H., Frank, A.: A primal-dual algorithm for submodular flows. Math. Oper. Res. 10, 251–262 (1985)
Danilov, V., Koshevoy, G., Lang, C.: Gross substitution, discrete convexity, and submodularity. Discrete Appl. Math. 131, 283–298 (2003)
Danilov, V., Koshevoy, G., Murota, K.: Discrete convexity and equilibria in economies with indivisible goods and money. Math. Social Sci. 41, 251–273 (2001)
Dress, A. W. M., Wenzel, W.: Valuated matroid: A new look at the greedy algorithm. Appl. Math. Lett. 3, 33–35 (1990)
Dress, A. W. M., Wenzel, W.: Valuated matroids. Adv. Math. 93, 214–250 (1992)
Edmonds, J.: “Submodular functions, matroids and certain polyhedra.” In Combinatorial Structures and Their Applications R. Guy, H. Hanani, N. Sauer and J. Schönheim, (eds.), pp. 69–87, Gordon and Breach, New York, 1970
Edmonds, J. , Giles, R.: A min-max relation for submodular functions on graphs. Ann. Discrete Math. 1, 185–204 (1977)
Eguchi, A., Fujishige, S.: An extension of the Gale-Shapley matching algorithm to a pair of M♮-concave functions, Discrete Mathematics and Systems Science Research Report 02-05, Osaka University, (2002)
Frank, A.: Generalized polymatroids, in Finite and Infinite Sets, I (A. Hajnal, L. Lovász and V. T. Sós, Eds.), pp. 285–294, North-Holland, Amsterdam, 1984
Frank, A., Tardos, É.: Generalized polymatroids and submodular flows. Math. Programming 42, 489–563 (1988)
Fujishige, S.: Lexicographically optimal base of a polymatroid with respect to a weight vector. Math. Oper. Res. 5, 186–196 (1980)
Fujishige, S.: Submodular Functions and Optimization, Annals of Discrete Mathematics 47, North-Holland, Amsterdam, 1991
Fujishige, S., Tamura, A.: A general two-sided matching market with discrete concave utility functions, RIMS Preprints No. 1401, Kyoto University, (2003)
Fujishige, S., Yang, Z.: A note on Kelso and Crawford’s gross substitutes condition. Math. Oper. Res. 28, 463–469 (2003)
Groenevelt, H.: Two algorithms for maximizing a separable concave function over a polymatroid feasible region. European J. Oper. Res. 54, 227–236 (1991)
Hochbaum, D. S.: Lower and upper bounds for the allocation problem and other nonlinear optimization problems. Math. Oper. Res. 19, 390–409 (1994)
Iwata, S.: A fully combinatorial algorithm for submodular function minimization. J. Combin. Theory Ser. B 84, 203–212 (2002)
Iwata, S., Fleischer, L., Fujishige, S.: A combinatorial, strongly polynomial algorithm for minimizing submodular functions. J. Assoc. Comput. Mach. 48, 761–777 (2001)
Iwata, S., Shigeno, M.: Conjugate scaling algorithm for Fenchel-type duality in discrete convex optimization. SIAM J. Optim. 13, 204–211 (2002)
Lehmann, B., Lehmann, D., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. Games and Economic Behavior to appear
Lovász, L.: “Submodular functions and convexity.” In Mathematical Programming — The State of the Art A. Bachem, M. Grötschel and B. Korte, (eds.), pp. 235–257, Springer-Verlag, Berlin, 1983
Moriguchi, S., Murota, K., Shioura, A.: Scaling algorithms for M-convex function minimization. IEICE Trans. Fundamentals E85-A, 922–929 (2002)
Murota, K.: Convexity and Steinitz’s exchange property. Adv. Math. 124, 272–311 (1996)
Murota, K.: Discrete convex analysis. Math. Programming 83, 313–371 (1998)
Murota, K.: Submodular flow problem with a nonseparable cost function. Combinatorica 19, 87–109 (1999)
Murota, K.: Matrices and Matroids for Systems Analysis, Springer-Verlag, Berlin, 2000
Murota, K.: Discrete Convex Analysis, Society for Industrial and Applied Mathematics, Philadelphia, 2003
Murota, K., Shioura, A.: Quasi M-convex and L-convex functions — quasiconvexity in discrete optimization. Discrete Appl. Math. 131, 467–494 (2003)
Murota, K., Tamura, A.: New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities. Discrete Appl. Math. 131, 495–512 (2003)
Murota, K., Tamura, A.: Application of M-convex submodular flow problem to mathematical economics. Japan J. Indust. Appl. Math. 20, 257–277 (2003)
Rockafellar, R. T.: Convex Analysis, Princeton University Press, Princeton, 1970
Saito, K., Oshiro, T.: On M-convex function minimization algorithms (in Japanese). Bachelor Thesis, Dept. of Management Science, Tokyo University of Science, (2003)
Schrijver, A.: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Combin. Theory Ser. B 80, 346–355 (2000)
Shioura, A.: Minimization of an M-convex function. Discrete Appl. Math. 84, 215–220 (1998)
Shioura, A.: Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. Discrete Appl. Math. 134, 303–316 (2004)
Author information
Authors and Affiliations
Corresponding author
Additional information
Mathematics Subject Classification (2000):90C27, 68W40, 05B35
This work is supported by a Grant-in-Aid for Scientific Research from the Ministry of Education, Culture, Sports, Science and Technology of Japan.
Rights and permissions
About this article
Cite this article
Tamura, A. Coordinatewise domain scaling algorithm for M-convex function minimization. Math. Program. 102, 339–354 (2005). https://doi.org/10.1007/s10107-004-0522-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-004-0522-y