Submodular Function Minimization and Polarity

12/31/2019
by   Alper Atamturk, et al.
0

Using polarity, we give an outer polyhedral approximation for the epigraph of set functions. For a submodular function, we prove that the corresponding polar relaxation is exact; hence, it is equivalent to the Lovász extension. The polar approach provides an alternative proof for the convex hull description of the epigraph of a submodular function. Preliminary computations show that the inequalities from outer approximations can be effective as cutting planes for solving submodular as well as non-submodular set function minimization problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/29/2019

Minimizing approximately submodular functions

The problem of minimizing a submodular function is well studied; several...
research
05/24/2023

Supermodular Rank: Set Function Decomposition and Optimization

We define the supermodular rank of a function on a lattice. This is the ...
research
03/10/2018

Submodular Hypergraphs: p-Laplacians, Cheeger Inequalities and Spectral Clustering

We introduce submodular hypergraphs, a family of hypergraphs that have d...
research
02/05/2021

Exploring the Subgraph Density-Size Trade-off via the Lovász Extension

Given an undirected graph, the Densest-k-Subgraph problem (DkS) seeks to...
research
09/06/2018

Yes, IoU loss is submodular - as a function of the mispredictions

This note is a response to [7] in which it is claimed that [13, Proposit...
research
07/11/2022

Submodular Dominance and Applications

In submodular optimization we often deal with the expected value of a su...
research
03/10/2018

Revisiting Decomposable Submodular Function Minimization with Incidence Relations

We introduce a new approach to decomposable submodular function minimiza...

Please sign up or login with your details

Forgot password? Click here to reset