Note on Steepest Descent Algorithm for Quasi L$^{\natural}$-convex Function Minimization
Preprint
Abstract
We define a class of discrete quasi convex functions, called semi-strictly quasi L$^{\natural}$-convex functions, and show that the steepest descent algorithm for L$^{\natural}$-convex function minimization also works for this class of quasi convex functions. The analysis of the exact number of iterations is also extended, revealing the so-called geodesic property of the steepest descent algorithm when applied to semi-strictly quasi L$^{\natural}$-convex functions.Keywords
All Related Versions
This publication has 3 references indexed in Scilit:
- Exact bounds for steepest descent algorithms of -convex function minimizationOperations Research Letters, 2014
- Quasi M-convex and L-convex functions—quasiconvexity in discrete optimizationDiscrete Applied Mathematics, 2003
- Discrete convex analysisMathematical Programming, 1998