The regularized submodular maximization via the Lyapunov method

DOI10.1007/978-3-031-49193-1_10MaRDI QIDQ6591625

Chen-Chen Wu, Xin Sun, Da-Chuan Xu, Unnamed Author, Cong-Ying Han

Publication date: 22 August 2024

zbMATH Keywords

Lyapunov functiondown-closed family of setsapproximation algorithm design and analysisregularized submodular maximization

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
• Note on the derivatives with respect to a parameter of the solutions of a system of differential equations.
• Correction to: ``Guess free maximization of submodular and linear sums
• A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights
• Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
• The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods
• A variational perspective on accelerated methods in optimization
• A Unified Continuous Greedy Algorithm for Submodular Maximization
• Guess free maximization of submodular and linear sums

This page was built for publication: The regularized submodular maximization via the Lyapunov method