1.2k citations · 1.6k across the 35 of their papers we have counts for
6 papers · 1 filter
The exact worst-case asymptotic rate of Nesterov acceleration for strongly convex optimization
Sebastian Pokutta, Bartolomeo Stellato
We study Nesterov's accelerated gradient method with its standard constant parameters for smooth strongly convex optimization. We characterize the exact worst-case asymptotic facto…
GLENS: Global Search via Learning from Solver Iterates with Diffusion Models
Anjian Li, Bartolomeo Stellato, Ryne Beeson
We consider the problem of generating a large collection of initial guesses for local minima of multimodal non-convex continuous optimization problems. The goal is for these initia…
Disjunctive Sum of Squares
Amir Ali Ahmadi, Sanjeeb Dash, Yixuan Hua +1
We introduce the concept of disjunctive sum of squares for certifying nonnegativity of polynomials. Unlike the popular sum of squares approach where nonnegativity is certified by a…
Lower Bounds for Frank-Wolfe on Strongly Convex Sets
Jannis Halbey, Daniel Deza, Max Zimmer +3
We present a constructive lower bound of for Frank-Wolfe (FW) when both the objective and the constraint set are smooth and strongly convex, showing that…
Conformal Prediction for Early Stopping in Mixed Integer Optimization
Stefan Clarke, Bartolomeo Stellato
Mixed-integer optimization solvers often find optimal solutions early in the search, yet spend the majority of computation time proving optimality. We exploit this by learning when…
Batched First-Order Methods for Parallel LP Solving in MIP
Nicolas Blin, Stefano Gualandi, Christopher Maes +2
We present a batched first-order method for solving multiple linear programs in parallel on GPUs. Our approach extends the primal-dual hybrid gradient algorithm to efficiently solv…