Seminar : Submodular functions and convexity
نویسنده
چکیده
In that spirit, the topics fall into “fundamental” and “applications”. The “fundamentals” are given priority as they are, well, fundamental. Team-work across topics is indicated and encouraged. If you have suggestions for additional topics, please contact me! Regarding participation you are expected to attend regularly, give a talk (∼ 45min.), and submit a term paper (∼8 pages). The seminar will take place Wednesdays, 10-12, Arnimallee 2. Please subscribe to the mailinglist at https://lists.fu-berlin.de/listinfo/SubModFct
منابع مشابه
Polyhedral aspects of Submodularity, Convexity and Concavity
The seminal work by Edmonds [9] and Lovász [39] shows the strong connection between submodular functions and convex functions. Submodular functions have tight modular lower bounds, and a subdifferential structure [16] in a manner akin to convex functions. They also admit polynomial time algorithms for minimization and satisfy the Fenchel duality theorem [18] and the Discrete Seperation Theorem ...
متن کاملSome Results about the Contractions and the Pendant Pairs of a Submodular System
Submodularity is an important property of set functions with deep theoretical results and various applications. Submodular systems appear in many applicable area, for example machine learning, economics, computer vision, social science, game theory and combinatorial optimization. Nowadays submodular functions optimization has been attracted by many researchers. Pendant pairs of a symmetric...
متن کاملMulti-Agent Combinatorial Optimization under Submodular Functions
Submodular functions are the discrete ananlogue of convexity and generalize many known and well studied settings. They capture several economic principles such as decreasing marginal cost and correlated utilities. Multi-agent allocation problems over submodular functions arise in a variety of natural scenarios and have been the subject of extensive study over the last decade. In this proposal I...
متن کاملSubmodular Functions: from Discrete to Continous Domains
Submodular set-functions have many applications in combinatorial optimization, as they can be minimized and approximately maximized in polynomial time. A key element in many of the algorithms and analyses is the possibility of extending the submodular set-function to a convex function, which opens up tools from convex optimization. Submodularity goes beyond set-functions and has naturally been ...
متن کاملA Min-Max Theorem for k-submodular Functions and Extreme Points of the Associated Polyhedra
A. Huber and V. Kolmogorov (ISCO 2012) introduced a concept of k-submodular function as a generalization of ordinary submodular (set) functions and bisubmodular functions. They presented a min-max relation for the k-submodular function minimization by considering l1 norm, which requires a non-convex set of feasible solutions associated with the k-submodular function. Our approach overcomes the ...
متن کامل