ALGORITHMS FOR L-CONVEX FUNCTION MINIMIZATION: CONNECTION BETWEEN DISCRETE CONVEX ANALYSIS AND OTHER RESEARCH FIELDS
DOI10.15807/JORSJ.60.216zbMATH Open1382.90078OpenAlexW2740271283MaRDI QIDQ4596997FDOQ4596997
Authors: Akiyoshi Shioura
Publication date: 11 December 2017
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15807/jorsj.60.216
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
discrete optimizationsteepest descent algorithmanalysis of algorithmdiscrete convex functioniterative auction
Convex programming (90C25) Auctions, bargaining, bidding and selling, and other market models (91B26) Computing methodologies for image processing (68U10)
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
- A flow-based ascending auction to compute buyer-optimal Walrasian prices
- Discrete midpoint convexity
- Directed discrete midpoint convexity
- 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)