1 citations · 1 across the 7 of their papers we have counts for
8 papers
A few more Lonely Runners
Avinash Bhardwaj, Vishnu Narayanan, Hrishikesh Venkataraman
Lonely Runner Conjecture, proposed by Jörg M. Wills and so nomenclatured by Luis Goddyn, has been an object of interest since it was first conceived in 1967 : Given positive intege…
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…
Stochastic Gradient Methods with Compressed Communication for Decentralized Saddle Point Problems
Chhavi Sharma, Vishnu Narayanan, P. Balamurugan
We develop two compression based stochastic gradient algorithms to solve a class of non-smooth strongly convex-strongly concave saddle-point problems in a decentralized setting (wi…
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…
Memory-efficient structured convex optimization via extreme point sampling
Nimita Shinde, Vishnu Narayanan, James Saunderson
Memory is a key computational bottleneck when solving large-scale convex optimization problems such as semidefinite programs (SDPs). In this paper, we focus on the regime in which…
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…