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

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.

Bibliographic Details

Published in:	Operations research letters Vol. 42; no. 5; pp. 361 - 366
Main Authors:	Murota, Kazuo, Shioura, Akiyoshi
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.07.2014
Subjects:	Analysis of algorithm Discrete convex function Discrete optimization Steepest descent algorithm Discrete optimization Steepest descent algorithm Discrete convex function Analysis of algorithm
ISSN:	0167-6377, 1872-7468
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!