research
∙
08/14/2023
On a semidefinite programming characterizations of the numerical radius and its dual norm
We give a semidefinite programming characterization of the dual norm of ...
share
research
∙
01/25/2023
Bit-complexity estimates in geometric programming, and application to the polynomial-time computation of the spectral radius of nonnegative tensors
We show that the spectral radius of nonnegative tensors can be approxima...
research
∙
05/02/2020
Tensor optimal transport, distance between sets of measures and tensor scaling
We study the optimal transport problem for d>2 discrete measures. This i...
research
∙
03/16/2020
Symmetric Grothendieck inequality
We establish an analogue of the Grothendieck inequality where the rectan...
research
∙
05/26/2019
Partial minimization of strict convex functions and tensor scaling
Assume that f is a strict convex function with a unique minimum in R^n. ...
research
∙
05/24/2013