On polynomial-time solvability of combinatorial Markov random fields

The problem of inferring Markov random fields (MRFs) with a sparsity or robustness prior can be naturally modeled as a mixed-integer program. This motivates us to study a general class of convex submodular optimization problems with indicator variables, which we show to be polynomially solvable in t...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Han, Shaoning, Gómez, Andrés, Pang, Jong-Shi
Format:	Artikel
Sprache:	eng
Schlagworte:	Mathematics - Optimization and Control
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!