3 papers
math.OC2025
On exactness of SDP relaxation for the maximum cut problem
Avinash Bhardwaj, Hritiz Gogoi, Vishnu Narayanan +1
Semidefinite programming (SDP) provides a powerful relaxation for the maximum cut problem. In this work, we characterize a few classes of graphs for which the SDP relaxation is exa…
math.OC2024
On generators of -PSD closures of the positive semidefinite cone
Avinash Bhardwaj, Vishnu Narayanan, Abhishek Pathapati
Positive semidefinite (PSD) cone is the cone of positive semidefinite matrices, and is the object of interest in semidefinite programming (SDP). A computational efficient approxima…
math.OC2022
Exact augmented Lagrangian duality for mixed integer convex optimization
Avinash Bhardwaj, Vishnu Narayanan, Abhishek Pathapati
Augmented Lagrangian dual augments the classical Lagrangian dual with a non-negative non-linear penalty function of the violation of the relaxed/dualized constraints in order to re…