4 papers
Memory-Efficient Approximation Algorithms for Max-k-Cut and Correlation Clustering
Nimita Shinde, Vishnu Narayanan, James Saunderson
Max-k-Cut and correlation clustering are fundamental graph partitioning problems. For a graph with G=(V,E) with n vertices, the methods with the best approximation guarantees for M…
On the quality of the PSD closure approximation
Avinash Bhardwaj, Harshit Kothari, Vishnu Narayanan
Postive semidefinite (PSD) cone is the cone of positive semidefinite matrices, and is the object of interest in semidefinite programming (SDP). A computational efficient approximat…
Submodular Function Minimization and Polarity
Alper Atamturk, Vishnu Narayanan
Using polarity, we give an outer polyhedral approximation for the epigraph of set functions. For a submodular function, we prove that the corresponding polar relaxation is exact; h…
A scaled conjugate gradient based direct search algorithm for high dimensional box constrained derivative free optimization
Gannavarapu Chandramouli, Vishnu Narayanan
In this work, we propose an efficient method for solving box constrained derivative free optimization problems involving high dimensions. The proposed method relies on exploring th…