ALGORITHMS FOR L-CONVEX FUNCTION MINIMIZATION: CONNECTION BETWEEN DISCRETE CONVEX ANALYSIS AND OTHER RESEARCH FIELDS
From MaRDI portal
Publication:4596997
Recommendations
- scientific article; zbMATH DE number 757675
- A new algorithm for minimizing convex functions over convex sets
- Discrete L-convex function minimization based on continuous relaxation
- scientific article; zbMATH DE number 439380
- scientific article; zbMATH DE number 2159405
- scientific article; zbMATH DE number 2161081
- On Steepest Descent Algorithms for Discrete Convex Functions
- scientific article; zbMATH DE number 3878691
- Discrete convex functions on graphs and their algorithmic applications
- Efficient algorithms for discrepancy minimization in convex sets
Cited in
(9)- Note on the polyhedral description of the Minkowski sum of two L-convex sets
- Discrete convex functions on graphs and their algorithmic applications
- Discrete midpoint convexity
- Directed discrete midpoint convexity
- A flow-based ascending auction to compute buyer-optimal Walrasian prices
- Recent progress on integrally convex functions
- On basic operations related to network induction of discrete convex functions
- Note on time bounds of two-phase algorithms for \(L\)-convex function minimization
- A survey of fundamental operations on discrete convex functions of various kinds
This page was built for publication: ALGORITHMS FOR L-CONVEX FUNCTION MINIMIZATION: CONNECTION BETWEEN DISCRETE CONVEX ANALYSIS AND OTHER RESEARCH FIELDS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596997)