Lov\'asz extension and graph cut

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