Lovasz extension and graph cut
A set pair Lov\'asz extension is established to construct equivalent continuous optimization problems for graph cut including the maxcut, Cheeger cut, dual Cheeger cut, max 3 cut, anti Cheeger cut problems, etc.