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

Full description

Bibliographic Details

Published in:	Optimization Vol. 73; no. 6; pp. 1739 - 1765
Main Authors:	Lu, Cheng, Yang, Wenguo, Gao, Suixiang
Format:	Journal Article
Language:	English
Published:	Philadelphia Taylor & Francis 02.06.2024 Taylor & Francis LLC
Subjects:	Algorithms Constraints continuous greedy algorithm Greedy algorithms Maximization Optimization random greedy algorithm regularized problem sampling Submodular maximization Weighting
ISSN:	0233-1934, 1029-4945
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!