Lovász extension and graph cut

Abstract

A set-pair Lovász extension is established to construct equivalent continuous optimization problems for graph $k$-cut problems.