Abstract
We analyze minimization algorithms for L-convex functions in discrete convex analysis and establish exact bounds for the number of iterations required by the steepest descent algorithm and its variants.
Original language | English |
---|---|
Pages (from-to) | 361-366 |
Number of pages | 6 |
Journal | Operations Research Letters |
Volume | 42 |
Issue number | 5 |
DOIs | |
Publication status | Published - 2014 Jul |
Keywords
- Analysis of algorithm
- Discrete convex function
- Discrete optimization
- Steepest descent algorithm
ASJC Scopus subject areas
- Software
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics