Back to Search
Start Over
ON STEEPEST DESCENT ALGORITHMS FOR DISCRETE CONVEX FUNCTIONS.
- Source :
-
SIAM Journal on Optimization . 2003, Vol. 14 Issue 3, p699-707. 9p. - Publication Year :
- 2003
-
Abstract
- This paper investigates the complexity of steepest descent algorithms for two classes of discrete convex functions: M-convex functions and L-convex functions. Simple tie-breaking rules yield complexity bounds that are polynomials in the dimension of the variables and the size of the effective domain. Combining the present results with a standard scaling approach leads to an efficient algorithm for L-convex function minimization. [ABSTRACT FROM AUTHOR]
- Subjects :
- *ALGORITHMS
*CONVEX functions
*POLYNOMIALS
*STATISTICAL physics
*MATHEMATICS
Subjects
Details
- Language :
- English
- ISSN :
- 10526234
- Volume :
- 14
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- SIAM Journal on Optimization
- Publication Type :
- Academic Journal
- Accession number :
- 13107788
- Full Text :
- https://doi.org/10.1137/S1052623402419005