Exact bounds for steepest descent algorithms of L-convex function minimization
Year of publication: |
2014
|
---|---|
Authors: | Murota, Kazuo ; Shioura, Akiyoshi |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 42.2014, 5, p. 361-366
|
Subject: | Discrete convex function | Analysis of algorithm | Discrete optimization | Steepest descent algorithm | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Shioura, Akiyoshi, (2022)
-
Randomized algorithms for lexicographic inference
Kohli, Rajeev, (2019)
-
How to Solve Real-world Optimization Problems : From Theory to Practice
Zak, Eugene J., (2024)
- More ...
-
Time Bounds for Iterative Auctions: A Unified Approach by Discrete Convex Analysis
Murota, Kazuo, (2014)
-
M-Convex Function on Generalized Polymatroid
Murota, Kazuo, (1999)
-
Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items
Murota, Kazuo, (2013)
- More ...