The course will take an in-depth look at the main concepts and algorithms in convex optimization. The goal is to develop expert knowledge in duality and in the design and analysis of algorithms for ...

Convex geometry and combinatorial optimisation form a vibrant nexus of research that bridges theoretical mathematics with practical algorithm design. The study of convex sets and their structural ...

Purdue faculty dedicate countless hours to exploring the frontiers of their respective fields, pushing the boundaries of knowledge and contributing to the ever-evolving landscape of academia. To ...