On steepest descent algorithms for discrete convex functions

SIAM Journal on Optimization

Volumn 14, Issue 3, 2004, Pages 699-707

  Murota, Kazuo ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

Discrete convex function; Discrete optimization; L convex function; M convex function; Steepest descent algorithm

Indexed keywords

EID: 4043168508     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623402419005     Document Type: Article

References (26)

1. W. J. COOK, W. H. CUNNINGHAM, W. R. PULLEYBLANK, AND A. SCHRIJVER, Combinatorial Optimization, John Wiley and Sons, New York, 1998.
2. A. W. M. DRESS AND W. WENZEL, Valuated matroid: A new look at the greedy algorithm, Appl. Math. Lett., 3 (1990), pp. 33-35.
3. J. EDMONDS, Submodular functions, matroids and certain polyhedra, in Combinatorial Structures and Their Applications, R. Guy, H. Hanani, N. Sauer, and J. Schönheim, eds., Gordon and Breach, New York, 1970, pp. 69-87.
4. P. FAVATI AND F. TARDELLA, Convexity in nonlinear integer programming, Ricerca Operativa, 53 (1990), pp. 3-44.
5. A. FRANK, An algorithm for submodular functions on graphs, in Bonn Workshop on Combinatorial Optimization, Ann. Discrete Math. 16, North-Holland, Amsterdam, New York, 1982, pp. 97-120.
6. S. FUJISHIGE, Theory of submodular programs: A Fenchel-type min-max theorem and subgradients of submodular functions, Math. Program., 29 (1984), pp. 142-155.
7. S. FUJISHIGE, Submodular Functions and Optimization, Ann. Discrete Math. 47, North-Holland, Amsterdam, 1991.
8. S. FUJISHIGE AND K. MUROTA, Notes on L-/M-convex functions and the separation theorems, Math. Program., 88 (2000), pp. 129-146.
9. S. IWATA, Oral presentation at Workshop on Matroids, Matching, and Extensions, University of Waterloo, ON, Canada, 1999.
10. S. IWATA, A faster scaling algorithm for minimizing submodular functions, in Integer Programming and Combinatorial Optimization, W. J. Cook and A. S. Schulz, eds., Lecture Notes in Comput. Sci. 2337, Springer-Verlag, New York, 2002, pp. 1-8.
11. S. IWATA, L. FLEISCHER, AND S. FUJISHIGE, A combinatorial, strongly polynomial-time algorithm, for minimizing submodular functions, J. ACM, 48 (2001), pp. 761-777.
12. S. IWATA AND M. SHIGENO, Conjugate scaling algorithm for Fenchel-type duality in discrete convex optimization, SIAM J. Optim., 13 (2002), pp. 204-211.
13. L. LOVÁSZ, Submodular functions and convexity, in Mathematical Programming - The State of the Art, A. Bachem, M. Grötschel, and B. Korte, eds., Springer-Verlag, Berlin, 1983, pp. 235-257.
14. S. T. MCCORMICK, Submodular function minimization, in Handbook on Discrete Optimization, K. Aardal, G. Nemhauser, and R. Weismantel, eds., Elsevier Science, Amsterdam, to appear.
15. B. L. MILLER, On minimizing nonseparable functions defined on the integers with an inventory application, SIAM J. Appl. Math., 21 (1971), pp. 166-185.
16. S. MORIGUCHI, K. MUROTA, AND A. SHIOURA, Scaling algorithms for M-convex function minimization, IEICE Trans. Fundamentals of Electronics, Communications and Computer Sciences, E85-A (2002), pp. 922-929.
17. K. MUROTA, Convexity and Steinitz's exchange property, Adv. Math., 124 (1996), pp. 272-311.
18. K. MUROTA, Discrete convex analysis, Math. Program., 83 (1998), pp. 313-371.
19. K. MUROTA, Algorithms in discrete convex analysis, IEICE Trans. Systems and Information, E83-D (2000), pp. 344-352.
20. K. MUROTA, Discrete Convex Analysis - An Introduction, Kyoritsu, Tokyo, 2001 (in Japanese).
21. K. MUROTA, Discrete Convex Analysis, SIAM, Philadelphia, 2003.
22. K. MUROTA AND A. SHIOURA, M-convex function on generalized polymatroid, Math. Oper. Res., 24 (1999), pp. 95-105.
23. A. SCHRIJVER, A combinatorial algorithm minimizing submodular functions in strongly polynomial time, J. Combin. Theory Ser. B, 80 (2000), pp. 346-355.
24. A. SHIOURA, Minimization of an M-convex function, Discrete Appl. Math., 84 (1998), pp. 215-220.
25. A. SHIOURA, Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem, Discrete Appl. Math., 134 (2003), pp. 303-316.
26. A. TAMURA, Coordinatewise domain scaling algorithm for M-convex function minimization, in Integer Programming and Combinatorial Optimization, W. J. Cook and A. S. Schulz, eds., Lecture Notes in Comput. Sci. 2337, Springer-Verlag, New York, 2002, pp. 21-35.