Equivalence of convex minimization problems over base polytopes

Japan Journal of Industrial and Applied Mathematics

Volumn 29, Issue 3, 2012, Pages 519-534

  Nagano, Kiyohito ^a   Aihara, Kazuyuki ^a  

^a INSTITUTE OF INDUSTRIAL SCIENCE   (Japan)

Author keywords

Combinatorial optimization; Convex optimization; Submodular function

Indexed keywords

CONVEX FUNCTIONS; CONVEX MINIMIZATION; CONVEX OBJECTIVES; CONVEX OPTIMIZATION PROBLEMS; DECOMPOSITION ALGORITHM; OPTIMAL SOLUTIONS; POLYMATROIDS; POLYTOPES; SUBMODULAR; SUBMODULAR FUNCTIONS; SUFFICIENT CONDITIONS; USEFUL PROPERTIES;

ALGORITHMS; COMBINATORIAL OPTIMIZATION; CONVEX OPTIMIZATION; TOPOLOGY;

STRUCTURAL OPTIMIZATION;

EID: 84870880936     PISSN: 09167005     EISSN: 1868937X     Source Type: Journal    
DOI: 10.1007/s13160-012-0083-z     Document Type: Article

References (29)

1. Chudak, F.A., Nagano, K.: Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 79-88 (2007)
2. Dutta, B.: The egalitarian solution and reduced game properties in convex games. Int. J. Game Theory 19, 153-169 (1990)
3. Dutta, B., Ray, D.: A Concept of egalitarianism under participation constraints. Econometrica 57, 615-635 (1989)
4. Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: Guy, R., Hanai, H., Sauer, N., Schönheim, J. (eds.) Combinatorial Structures and Their Applications. Gordon and Breach, New York, pp. 69-87 (1970)
5. Fleischer, L., Iwata, S.: A push-relabel framework for submodular function minimization and applications to parametric optimization. Discrete Appl. Math. 131, 311-322 (2003)
6. Fujishige, S.: Lexicographically optimal base of a polymatroid with respect to a weight vector. Math. Oper. Res. 5, 186-196 (1980)
7. Fujishige, S.: Submodular systems and related topics. Math. Program. Study 22, 113-131 (1984)
8. Fujishige S. (2005) Submodular Functions and Optimization, 2nd edn. Elsevier, Amsterdam
9. Fujishige, S., Hayashi, T., Isotani, S.: The minimum-norm-point algorithm applied to submodular function minimization and linear programming. Research Institute forMathematical Sciences Preprint RIMS- 1571, Kyoto University, Kyoto, Japan (2006)
10. Gallo, G., Grigoriadis, M.D., Tarjan, R.E.: A fast parametric maximum flow algorithm and applications. SIAM J. Comput. 18, 30-55 (1989)
11. Groenevelt, H.: Two algorithms for maximizing a separable concave function over a polymatroid feasible region. Eur. J. Oper. Res. 54, 227-236 (1991) (Pubitemid 21729720)
12. Hayrapetyan, A., Swamy, C., Tardos E.: Network design for information networks. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 933-942 (2005) (Pubitemid 40851460)
13. Hochbaum, D.S.: Lower and upper bounds for the allocation problem and other nonlinear optimization problems. Math. Oper. Res. 19, 390-409 (1994)
14. Iwata, S.: Submodular function minimization. Math. Program. 112, 45-64 (2008) (Pubitemid 47167324)
15. Iwata, S., Fleischer, L., Fujishige, S.: A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM 48, 761-777 (2001)
16. Iwata, S., Nagano, K.: Submodular function minimization under covering constraints. In: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 671-680 (2009)
17. Jain, K., Vazirani, V.V.: Eisenberg-Gale markets: algorithms and structural properties. In: Proceedings of the 39th ACM Symposium on Theory of Computing, pp. 364-373 (2007) (Pubitemid 47630755)
18. Lovász, L.: Submodular functions and convexity. In: Bachem, A., Grötschel, M., Korte, B. (eds.) Mathematical Programming-The State of the Art, pp. 235-257. Springer, Berlin (1983)
19. Maruyama, F.:Aunified study on problems in information theory via polymatroids.Graduation Thesis, University of Tokyo, Japan (1978) (In Japanese.)
20. McCormick, S.T.: Submodular function minimization. In: Aardal, K., Nemhauser, G.L., Weismantel, R. (eds.) Discrete Optimization (Handbooks in Operations Research and Management Science, vol. 12), Chapter 7, pp. 321-391. Elsevier, Amsterdam (2005)
21. Megiddo, N.: Optimal flows in networks with multiple sources and sinks. Math. Program. 7, 97-107 (1974)
22. Murota, K.: Note on the universal bases of a pair of polymatroids. J. Oper. Res. Soc. Jpn. 31, 565-573 (1988)
23. Nagano, K.: A strongly polynomial algorithm for line search in submodular polyhedra. Discrete Optim. 4, 349-359 (2007) (Pubitemid 350167033)
24. Nagano, K.: A faster parametric submodular function minimization algorithm and applications. Technical Report METR 2007-43, University of Tokyo (2007)
25. Orlin, J.B.: A faster strongly polynomial time algorithm for submodular function minimization. Math. Program. 118, 237-251 (2009)
26. Schrijver, A.: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Comb. Theory (B) 80, 346-355 (2000)
27. Schrijver, A.: Combinatorial Optimization-Polyhedra and Efficiency. Springer, Berlin (2003)
28. Sharma, Y., Swamy, C.,Williamson, D.P.: Approximation algorithms for prize-collecting forest problems with submodular penalty functions. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1275-1284 (2007)
29. Wolfe, P.: Finding the nearest point in A polytope. Math. Program. 11, 128-149 (1976)