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

Kazuo Murota; Akiyoshi Shioura

doi:10.1016/j.orl.2014.06.005

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

Kazuo Murota, Akiyoshi Shioura

INF - System Information Sciences

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	361-366
Number of pages	6
Journal	Operations Research Letters
Volume	42
Issue number	5
DOIs	https://doi.org/10.1016/j.orl.2014.06.005
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

Access to Document

10.1016/j.orl.2014.06.005

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

@article{64b95d443d7b4f7d8ff5ea96898e49df,

title = "Exact bounds for steepest descent algorithms of L-convex function minimization",

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.",

keywords = "Analysis of algorithm, Discrete convex function, Discrete optimization, Steepest descent algorithm",

author = "Kazuo Murota and Akiyoshi Shioura",

year = "2014",

month = jul,

doi = "10.1016/j.orl.2014.06.005",

language = "English",

volume = "42",

pages = "361--366",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "5",

}

TY - JOUR

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

AU - Murota, Kazuo

AU - Shioura, Akiyoshi

PY - 2014/7

Y1 - 2014/7

N2 - 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.

AB - 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.

KW - Analysis of algorithm

KW - Discrete convex function

KW - Discrete optimization

KW - Steepest descent algorithm

UR - http://www.scopus.com/inward/record.url?scp=84903702514&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84903702514&partnerID=8YFLogxK

U2 - 10.1016/j.orl.2014.06.005

DO - 10.1016/j.orl.2014.06.005

M3 - Article

AN - SCOPUS:84903702514

VL - 42

SP - 361

EP - 366

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 5

ER -