Exact bounds for steepest descent algorithms of L-convex function minimization

Kazuo Murota, Akiyoshi Shioura

Research output: Contribution to journalArticlepeer-review

13 Citations (Scopus)

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 languageEnglish
Pages (from-to)361-366
Number of pages6
JournalOperations Research Letters
Volume42
Issue number5
DOIs
Publication statusPublished - 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

Fingerprint Dive into the research topics of 'Exact bounds for steepest descent algorithms of L-convex function minimization'. Together they form a unique fingerprint.

Cite this