Explores the convexity of Lovász extension and submodular function maximization, focusing on extending functions to convex sets and proving their convexity.
Explores KKT conditions in convex optimization, covering dual problems, logarithmic constraints, least squares, matrix functions, and suboptimality of covering ellipsoids.
