Majorisation-minimisation algorithms for minimising the difference between lattice submodular functions
Data Structures and Algorithms
2019-06-03 v1
Abstract
We consider the problem of minimising functions represented as a difference of lattice submodular functions. We propose analogues to the SupSub, SubSup and ModMod routines for lattice submodular functions. We show that our majorisation-minimisation algorithms produce iterates that monotonically decrease, and that we converge to a local minimum. We also extend additive hardness results, and show that a broad range of functions can be expressed as the difference of submodular functions.
Cite
@article{arxiv.1905.13492,
title = {Majorisation-minimisation algorithms for minimising the difference between lattice submodular functions},
author = {Conor McMeel and Panos Parpas},
journal= {arXiv preprint arXiv:1905.13492},
year = {2019}
}
Comments
13 pages