In this talk we essentially discuss a work on variational inequalities by Yuri Nestrov where the so called prox-functions play a major role. We discuss the approach in details giving complexity bounds and related results.
Suhail Sherif wins ACM India best thesis award for his thesis titled “Communication Complexity and Quantum Optimization Lower Bounds via Query Complexity” under the guidance of Prof. Arkadev Chattopadhyay.
Anand Deo and Karthyek Murthy receive honourable mention (third place) in INFORMS Junior Faculty Interest Group (JFIG) Paper Competition. This competition recognizes high quality work amongst junior faculty in the INFORMS community.
Neha Sangwan received the runner-up award for her poster at the Croucher Summer School on Information Theory held in Hong Kong
https://cscit.ie.cuhk.edu.hk/
Congratulations Neha Sangwan!
