A stochastic non-monotone DR-submodular maximization problem over a convex set

DOI10.1007/978-3-031-22105-7_1MaRDI QIDQ6168925zbMATH OpenFDO

Authors Yuefang Lian, Dachuan Xu, Donglei Du, Yang Zhou

Publication date 10 August 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-22105-7_1

zbMATH Keywords

continuous DR-submodularFrank-Wolfe algorithmgradient estimatorpotential functionstochastic optimization

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• A Unified Continuous Greedy Algorithm for Submodular Maximization
• Determinantal point processes for machine learning
• scientific article; zbMATH DE number 3790208 (Why is no real title available?)
• scientific article; zbMATH DE number 7255156 (Why is no real title available?)
• Introductory lectures on convex optimization. A basic course.
• Stochastic conditional gradient methods: from convex minimization to submodular maximization
• Stochastic conditional gradient++: (Non)convex minimization and continuous submodular maximization

Cited in

(2)

• scientific article; zbMATH DE number 7255156 (Why is no real title available?)
• Stochastic Variance Reduction for DR-Submodular Maximization

This page was built for publication: A stochastic non-monotone DR-submodular maximization problem over a convex set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6168925)