ALGORITHMS FOR L-CONVEX FUNCTION MINIMIZATION: CONNECTION BETWEEN DISCRETE CONVEX ANALYSIS AND OTHER RESEARCH FIELDS

DOI10.15807/jorsj.60.216zbMath1382.90078OpenAlexW2740271283MaRDI QIDQ4596997

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

zbMATH Keywords

steepest descent algorithmdiscrete optimizationanalysis of algorithmdiscrete convex functioniterative auction

Mathematics Subject Classification ID

Convex programming (90C25) Computing methodologies for image processing (68U10) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items

Note on time bounds of two-phase algorithms for \(L\)-convex function minimization, Recent progress on integrally convex functions, Discrete Midpoint Convexity, Directed discrete midpoint convexity, Discrete Convex Functions on Graphs and Their Algorithmic Applications, A survey of fundamental operations on discrete convex functions of various kinds, On basic operations related to network induction of discrete convex functions, Note on the polyhedral description of the Minkowski sum of two L-convex sets