TY - JOUR
T1 - Exact bounds for steepest descent algorithms of L-convex function minimization
AU - Murota, Kazuo
AU - Shioura, Akiyoshi
N1 - Funding Information:
Part of the results in this paper is presented (without proofs) in the extended abstract [18] in Proceedings of 24th International Symposium on Algorithms and Computation (ISAAC 2013). This research is supported by KAKENHI ( 21360045 , 21740060 , 24500002 ) and the Aihara Project, the FIRST program from JSPS.
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 -