On Steepest Descent Algorithms for Discrete Convex Functions
From MaRDI portal
Publication:4651964
DOI10.1137/S1052623402419005zbMath1071.90027MaRDI QIDQ4651964
Publication date: 23 February 2005
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
steepest descent algorithmdiscrete optimizationM-convex functiondiscrete convex functionL-convex function
Programming involving graphs or networks (90C35) Convex programming (90C25) Integer programming (90C10) Combinatorial optimization (90C27)
Related Items
M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System, Theory of Principal Partitions Revisited, Recent Developments in Discrete Convex Analysis, 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, Dijkstra's algorithm and L-concave function maximization, Exact bounds for steepest descent algorithms of $L$-convex function minimization, Conic relaxation approaches for equal deployment problems, New algorithms for convex cost tension problem with application to computer vision, A Note on Appointment Scheduling with Piecewise Linear Cost Functions
