Exact bounds for steepest descent algorithms of -convex function minimization
Authors:
- Kazuo MurotaKMKazuo Murota
- Akiyoshi ShiouraASAkiyoshi Shioura
- 1 July 2014
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 42 (5) , 361-366
Abstract
No abstract availableKeywords
Funding Information
- KAKENHI (21360045, 21740060, 24500002)
This publication has 15 references indexed in Scilit:
- On the Optimal Policy Structure in Serial Inventory Systems with Lost SalesOperations Research, 2010
- Phase Unwrapping via Graph CutsIEEE Transactions on Image Processing, 2007
- Image Restoration with Discrete Constrained Total Variation Part I: Fast and Exact OptimizationJournal of Mathematical Imaging and Vision, 2006
- An Efficient Dynamic Auction for Heterogeneous CommoditiesAmerican Economic Review, 2006
- Fast approximate energy minimization via graph cutsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2001
- The English Auction with Differentiated CommoditiesJournal of Economic Theory, 2000
- A dual algorithm for submodular flow problemsOperations Research Letters, 1991
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of ImagesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1984
- The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithmMathematical Programming, 1983
- Job Matching, Coalition Formation, and Gross SubstitutesEconometrica, 1982