Tag convex optimization

Understanding Submodular Functions: from Discrete to Continuous Domains

What are Submodular Set-Functions? Submodular set-functions are mathematical objects that have various applications in combinatorial optimization. These functions can be minimized and approximately maximized in polynomial time, making them valuable tools in solving optimization problems. Real-world example: Imagine you are… Continue Reading →

© 2024 Christophe Garon — Powered by WordPress

Theme by Anders NorenUp ↑