Abstract:
Sum of submodular function minimization is a combinatorial optimization problem(NP-Hard),
We begin with the Submodular function minimization and extending it to Sum of submodular
function(SOS), there are different algorithms dealing with this problem the best in running time
known is Min Norm Point Algorithm for Higher Order MRF-MAP Inference by (Ishant Shanu,
Dr. Chetan Arora, Pagar Singla), The approach that is used in this report uses cutting Plane
and other convex optimization Methods which are best known to deal with convex optimization
problems and we use it for Submodular function minimization.
