775 citations
- Eindhoven University of TechnologyNL24 papers
- Centrum Wiskunde & InformaticaNL23 papers
- University of AmsterdamNL14 papers
- Centre National de la Recherche ScientifiqueFR9 papers
- University College LondonGB9 papers
- Maastricht UniversityNL8 papers
- Delft University of TechnologyNL7 papers
- UCLouvainBE7 papers
- Universitat Politècnica de CatalunyaES7 papers
- University of AntwerpBE7 papers
- University of GroningenNL7 papers
- Georgia Institute of TechnologyUS6 papers
4 papers · 2 filters
New bounds for truthful scheduling on two unrelated selfish machines
Olga Kuryatnikova, Juan C. Vera
We consider the minimum makespan problem for tasks and two unrelated parallel selfish machines. Let be the best approximation ratio of randomized monotone scale-free algo…
Worst-case convergence analysis of inexact gradient and Newton methods through semidefinite programming performance estimation
Etienne de Klerk, Francois Glineur, Adrien Taylor
We provide new tools for worst-case performance analysis of the gradient (or steepest descent) method of Cauchy for smooth strongly convex functions, and Newton's method for self-c…
Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
Sander Gribling, David de Laat, Monique Laurent
In this paper we study bipartite quantum correlations using techniques from tracial noncommutative polynomial optimization. We construct a hierarchy of semidefinite programming low…
Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
Sander Gribling, David de Laat, Monique Laurent
We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of semidefinite programming lower bounds on matrix factorization ranks. In particul…