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...

Celý popis

Podrobná bibliografia

Vydané v:	Optimization Ročník 73; číslo 6; s. 1739 - 1765
Hlavní autori:	Lu, Cheng, Yang, Wenguo, Gao, Suixiang
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Philadelphia Taylor & Francis 02.06.2024 Taylor & Francis LLC
Predmet:	Algorithms Constraints continuous greedy algorithm Greedy algorithms Maximization Optimization random greedy algorithm regularized problem sampling Submodular maximization Weighting
ISSN:	0233-1934, 1029-4945
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!