Note on time bounds of two-phase algorithms for \(L\)-convex function minimization
From MaRDI portal
Publication:2400167
DOI10.1007/s13160-017-0246-zzbMath1369.90146OpenAlexW2611870487MaRDI QIDQ2400167
Akiyoshi Shioura, Kazuo Murota
Publication date: 28 August 2017
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13160-017-0246-z
Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Unnamed Item
- Multi-item Vickrey-Dutch auctions
- New algorithms for convex cost tension problem with application to computer vision
- The English auction with differentiated commodities
- Time bounds for iterative auctions: a unified approach by discrete convex analysis
- Exact bounds for steepest descent algorithms of $L$-convex function minimization
- Multi-item Vickrey-English-Dutch auctions
- Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items
- Job Matching, Coalition Formation, and Gross Substitutes
- Discrete Convex Analysis
- ALGORITHMS FOR L-CONVEX FUNCTION MINIMIZATION: CONNECTION BETWEEN DISCRETE CONVEX ANALYSIS AND OTHER RESEARCH FIELDS