Scaling algorithms for M-convex function minimization

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E85-A, Issue 5, 2002, Pages 922-929

  Moriguchi, Satoko ^a   Murota, Kazuo ^b   Shioura, Akiyoshi ^c  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b UNIVERSITY OF TOKYO   (Japan)

^c TOHOKU UNIVERSITY   (Japan)

Author keywords

Convex function; Discrete optimization; Matroid; Scaling algorithm

Indexed keywords

COMPUTATIONAL COMPLEXITY; FUNCTIONS; ITERATIVE METHODS; MATRIX ALGEBRA; OPTIMIZATION; POLYNOMIALS; THEOREM PROVING; VECTORS;

DISCRETE OPTIMIZATION; M-CONVEX FUNCTIONS; POLYNOMIAL TIME ALGORITHM; SCALING ALGORITHM;

ALGORITHMS;

EID: 0036579177     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (26)

1. Discrete convexity and equilibria in economies with indivisible goods and money
2. Evaluated matroid: A new look at the greedy algorithm
3. Valuated matroids
4. Matroids in combinatorial optimization
5. Convexity in nonlinear integer programming
6. Submodular functions and optimization
7. Lower and upper bounds for the allocation problem and other nonlinear boptimization problems
8. Submodular functions and convexity
9. On minimizing nonseparable functions defined on the integers with an investory application
10. Finding optimal minors of valuated bimatroids
11. Valuated matroid intersection, I: Optimality criteria
12. Evaluated matroid intersection, II: Algorithms
13. Fenchel-type duality for matroid valuations
14. Submodular flow problem with a nonseparable cost function
15. Convexity and Steinitz's exchange property
16. Discrete convex analysis
17. Discrete convex analysis - Exposition on conjugacy and duality
18. Quadratic M-convex and L-convex functions
19. Minimization of an M-convex function
20. Coordinatewise domain scaling algorithm for M-convex function minimization