Regularized nonmonotone submodular maximization

In this paper, we present a thorough study of the regularized submodular maximization problem, in which the objective $ f:=g-\ell $ f := g − ℓ can be expressed as the difference between a submodular function and a modular function. This problem has drawn much attention in recent years. While existin...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Optimization Jg. 73; H. 6; S. 1739 - 1765
Hauptverfasser:	Lu, Cheng, Yang, Wenguo, Gao, Suixiang
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Philadelphia Taylor & Francis 02.06.2024 Taylor & Francis LLC
Schlagworte:	Algorithms Constraints continuous greedy algorithm Greedy algorithms Maximization Optimization random greedy algorithm regularized problem sampling Submodular maximization Weighting
ISSN:	0233-1934, 1029-4945
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!