Steepest descent algorithm for M-convex function minimization using long step length
From MaRDI portal
Cites work
- \(M\)-convex function on generalized polymatroid
- A Note on Kelso and Crawford's Gross Substitutes Condition
- ALGORITHMS FOR L-CONVEX FUNCTION MINIMIZATION: CONNECTION BETWEEN DISCRETE CONVEX ANALYSIS AND OTHER RESEARCH FIELDS
- An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Conjugacy relationship between M-convex and L-convex functions in continuous variables
- Convexity and Steinitz's exchange property
- Coordinatewise domain scaling algorithm for M-convex function minimization
- Discrete convex analysis
- Discrete Convex Analysis
- Efficient algorithms for a family of matroid intersection problems
- Exact bounds for steepest descent algorithms of $L$-convex function minimization
- Extension of M-convexity and L-convexity to polyhedral convex functions
- Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem.
- Gross substitutability: an algorithmic survey
- GROSS SUBSTITUTES CONDITION AND DISCRETE CONCAVITY FOR MULTI-UNIT VALUATIONS: A SURVEY
- scientific article; zbMATH DE number 544186 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- Job Matching, Coalition Formation, and Gross Substitutes
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
- M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System
- Matroid optimization with the interleaving of two ordered sets
- Minimization of an M-convex function
- Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems
- Monotonicity in steepest ascent algorithms for polyhedral L-concave functions
- Network flows. Theory, algorithms, and applications.
- Nonlinear Programming
- On Steepest Descent Algorithms for Discrete Convex Functions
- Optimization problems with color-induced budget constraints
- Submodular functions and optimization.
- Substitute goods, auctions, and equilibrium
- The English auction with differentiated commodities
- The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
- Time bounds of basic steepest descent algorithms for \(M\)-convex function minimization and related problems
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region
- Valuated matroids: A new look at the greedy algorithm
- Walrasian equilibrium with gross substitutes
This page was built for publication: Steepest descent algorithm for M-convex function minimization using long step length
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7326084)
