2 citations · 2 across the 4 of their papers we have counts for
7 papers · 1 filter
Operator convexity along lines, self-concordance, and sandwiched Rényi entropies
Kerry He, James Saunderson, Hamza Fawzi
Barrier methods play a central role in the theory and practice of convex optimization. One of the most general and successful analyses of barrier methods for convex optimization, d…
QICS: Quantum Information Conic Solver
Kerry He, James Saunderson, Hamza Fawzi
We introduce QICS (Quantum Information Conic Solver), an open-source primal-dual interior point solver fully implemented in Python, which is focused on solving optimization problem…
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…
Certifying polynomial nonnegativity via hyperbolic optimization
James Saunderson
We describe a new approach to certifying the global nonnegativity of multivariate polynomials by solving hyperbolic optimization problems---a class of convex optimization problems…
Limitations on the expressive power of convex cones without long chains of faces
James Saunderson
A convex optimization problem in conic form involves minimizing a linear functional over the intersection of a convex cone and an affine subspace. In some cases, it is possible to…
Competitive Online Algorithms for Resource Allocation over the Positive Semidefinite Cone
Reza Eghbali, James Saunderson, Maryam Fazel
We consider a new and general online resource allocation problem, where the goal is to maximize a function of a positive semidefinite (PSD) matrix with a scalar budget constraint.…