On Steepest Descent Algorithms for Discrete Convex Functions
From MaRDI portal
Recommendations
- A Descent Algorithm for Minimizing Polyhedral Convex Functions
- On the steepest descent algorithm for quadratic functions
- Steepest descent on a uniformly convex space
- Gradient methods of maximization of convex functions on discrete structures
- Exact bounds for steepest descent algorithms of $L$-convex function minimization
- Convergence of the steepest descent method for minimizing quasiconvex functions
- A convergence result for discrete steepest descent in weighted Sobolev spaces
- Time bounds of basic steepest descent algorithms for \(M\)-convex function minimization and related problems
- Descent algorithm for a class of convex nondifferentiable functions
Cited in
(21)- New algorithms for convex cost tension problem with application to computer vision
- Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem.
- Time bounds for iterative auctions: a unified approach by discrete convex analysis
- Exact bounds for steepest descent algorithms of $L$-convex function minimization
- The complexity of minimizing the difference of two \(M^{\natural}\)-convex set functions
- A convergence result for discrete steepest descent in weighted Sobolev spaces
- Dijkstra's algorithm and L-concave function maximization
- Conic relaxation approaches for equal deployment problems
- Theory of principal partitions revisited
- Recent developments in discrete convex analysis
- Monotonicity in steepest ascent algorithms for polyhedral L-concave functions
- Discrete L-convex function minimization based on continuous relaxation
- Gradient methods of maximization of convex functions on discrete structures
- ALGORITHMS FOR L-CONVEX FUNCTION MINIMIZATION: CONNECTION BETWEEN DISCRETE CONVEX ANALYSIS AND OTHER RESEARCH FIELDS
- On steepest descent curves for quasi convex families in Rn
- Time bounds of basic steepest descent algorithms for \(M\)-convex function minimization and related problems
- M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System
- A note on appointment scheduling with piecewise linear cost functions
- scientific article; zbMATH DE number 7671922 (Why is no real title available?)
- Generalized minimum 0-extension problem and discrete convexity
- Steepest descent algorithm for M-convex function minimization using long step length
This page was built for publication: On Steepest Descent Algorithms for Discrete Convex Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4651964)
