On Convex Minimization over Base Polytopes

Authors:
Kiyohito Nagano
Affiliations:
University of Tokyo, Tokyo 113-8656, Japan, and, Kyoto University, Kyoto 606-8502, Japan
Venue:
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Year:
2007

Citing 10
Cited 4

A fast parametric maximum flow algorithm and applications

SIAM Journal on Computing
The egalitarian solution and reduced game properties in convex games

International Journal of Game Theory
Lower and upper bounds for the allocation problem and other nonlinear optimization problems

Mathematics of Operations Research
A combinatorial algorithm minimizing submodular functions in strongly polynomial time

Journal of Combinatorial Theory Series B
A push-relabel framework for submodular function minimization and applications to parametric optimization

Discrete Applied Mathematics - Submodularity
Network design for information networks

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Eisenberg-Gale markets: algorithms and structural properties

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for prize collecting forest problems with submodular penalty functions

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization

IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization

Eisenberg-Gale markets: algorithms and structural properties

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Ascending auctions for integral (poly)matroids with concave nondecreasing separable values

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
An Ascending Vickrey Auction for Selling Bases of a Matroid

Operations Research
Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This note considers convex optimization problems over base polytopes of polymatroids. We show that the decomposition algorithm for the separable convex function minimization problems helps us give simple sufficient conditions for the rationality of optimal solutions and that it leads us to some interesting properties, including the equivalence of the lexicographically optimal base problem, introduced by Fujishige, and the submodular utility allocation market problem, introduced by Jain and Vazirani. In addition, we develop an efficient implementation of the decomposition algorithm via parametric submodular function minimization algorithms. Moreover, we show that, in some remarkable cases, non-separable convex optimization problems over base polytopes can be solved in strongly polynomial time.