Can we accelerate convergence of gradient descent without changing the
a...
We study the problem of decomposing a polynomial p into a sum of r
squar...
Low-rank approximation of kernels is a fundamental mathematical problem ...
We study the problem of maximizing the geometric mean of d low-degree
no...
Given a graph, the shortest-path problem requires finding a sequence of ...
We revisit Min-Mean-Cycle, the classical problem of finding a cycle in a...
We revisit Matrix Balancing, a pre-conditioning task used ubiquitously f...
We study the convex relaxation of a polynomial optimization problem,
max...
Semidefinite programming (SDP) with equality constraints arise in many
o...
We introduce a novel representation of structured polynomial ideals, whi...
Rejoinder to "Latent variable graphical model selection via convex
optim...