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

被引：14
|
作者：
Murota, Kazuo [1 ]
Shioura, Akiyoshi [2 ]
机构：
[1] Univ Tokyo, Grad Sch Informat Sci & Technol, Tokyo 1138656, Japan
[2] Tohoku Univ, Grad Sch Informat Sci, Sendai, Miyagi 9808579, Japan
来源：
OPERATIONS RESEARCH LETTERS | 2014年 / 42卷 / 05期
关键词：
Discrete convex function; Analysis of algorithm; Discrete optimization; Steepest descent algorithm; RESTORATION; AUCTION;
D O I：
10.1016/j.orl.2014.06.005
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We analyze minimization algorithms for L-q-convex functions in discrete convex analysis and establish exact bounds for the number of iterations required by the steepest descent algorithm and its variants. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码：361 / 366
页数：6
相关论文
共 31 条
1234