A Coordinatewise Domain Scaling Algorithm for M-convex Function Minimization

Authors:
Akihisa Tamura
Affiliations:
-
Venue:
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Year:
2002

Citing 12
Cited 1

Generalized polymatroids and submodular flows

Mathematical Programming: Series A and B
Lower and upper bounds for the allocation problem and other nonlinear optimization problems

Mathematics of Operations Research
Minimization of an M-convex function

Discrete Applied Mathematics
Discrete convex analysis

Mathematical Programming: Series A and B
A combinatorial algorithm minimizing submodular functions in strongly polynomial time

Journal of Combinatorial Theory Series B
A combinatorial strongly polynomial algorithm for minimizing submodular functions

Journal of the ACM (JACM)
A fully combinatorial algorithm for submodular function minimization

Journal of Combinatorial Theory Series B
Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization

SIAM Journal on Optimization
Quasi M-convex and L-convex functions: quasiconvexity in discrete optimization

Discrete Applied Mathematics - Submodularity
New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities

Discrete Applied Mathematics - Submodularity
Application of M-Convex Submodular Flow Problem to Mathematical Economics

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Matrices and Matroids for Systems Analysis

Matrices and Matroids for Systems Analysis

Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a polynomial time domain 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 to play a fundamental role in tractable cases of discrete optimization. The novel idea of the algorithm is to use an individual scaling factor for each coordinate.