Pages that link to "Item:Q1785253"
From MaRDI portal
The following pages link to Exact bounds for steepest descent algorithms of $L$-convex function minimization (Q1785253):
Displaying 10 items.
- L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem (Q1751126) (← links)
- Time bounds for iterative auctions: a unified approach by discrete convex analysis (Q1751147) (← links)
- Robust budget allocation via continuous submodular functions (Q2019911) (← links)
- Directed discrete midpoint convexity (Q2024598) (← links)
- Note on time bounds of two-phase algorithms for \(L\)-convex function minimization (Q2400167) (← links)
- Discrete Convex Functions on Graphs and Their Algorithmic Applications (Q4689627) (← links)
- Discrete Midpoint Convexity (Q5108259) (← links)
- Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings (Q5234537) (← links)
- Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids (Q6180564) (← links)
- Generalized minimum 0-extension problem and discrete convexity (Q6665385) (← links)
