Pages that link to "Item:Q4651964"
From MaRDI portal
The following pages link to On Steepest Descent Algorithms for Discrete Convex Functions (Q4651964):
Displaying 17 items.
- New algorithms for convex cost tension problem with application to computer vision (Q1040084) (← links)
- Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. (Q1421475) (← links)
- Time bounds for iterative auctions: a unified approach by discrete convex analysis (Q1751147) (← links)
- Exact bounds for steepest descent algorithms of $L$-convex function minimization (Q1785253) (← links)
- The complexity of minimizing the difference of two \(M^{\natural}\)-convex set functions (Q1785434) (← links)
- A convergence result for discrete steepest descent in weighted Sobolev spaces (Q1809789) (← links)
- Dijkstra's algorithm and L-concave function maximization (Q2248748) (← links)
- Conic relaxation approaches for equal deployment problems (Q2297663) (← links)
- Theory of Principal Partitions Revisited (Q2971607) (← links)
- Recent Developments in Discrete Convex Analysis (Q2971611) (← links)
- MONOTONICITY IN STEEPEST ASCENT ALGORITHMS FOR POLYHEDRAL L-CONCAVE FUNCTIONS (Q3456031) (← links)
- ALGORITHMS FOR L-CONVEX FUNCTION MINIMIZATION: CONNECTION BETWEEN DISCRETE CONVEX ANALYSIS AND OTHER RESEARCH FIELDS (Q4596997) (← links)
- On steepest descent curves for quasi convex families in Rn (Q4982608) (← links)
- M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System (Q5085152) (← links)
- A Note on Appointment Scheduling with Piecewise Linear Cost Functions (Q5247619) (← links)
- About the steepness of the function of discrete argument (Q5885543) (← links)
- Generalized minimum 0-extension problem and discrete convexity (Q6665385) (← links)
