4 papers · 1 filter
Linear Convergence and Error Bounds for Optimization Without Strong Convexity
Kira van Treek, Javier F. Peña, Juan C. Vera +1
Many optimization algorithms$\unicode{x2013}$including gradient descent, proximal methods, and operator splitting techniques$\unicode{x2013}$can be formulated as fixed-point iterat…
Low degree sum-of-squares bounds for the stability number: a copositive approach
Luis Felipe Vargas, Juan C. Vera, Peter J. C. Dickinson
The stability number of a graph , denoted as , is the maximum size of an independent (stable) set in . Semidefinite programming (SDP) methods, which originated from Lov…
SDP bounds on the stability number via ADMM and intermediate levels of the Lasserre hierarchy
Lennart Sinjorgo, Renata Sotirov, Juan C. Vera
We consider the Lasserre hierarchy for computing bounds on the stability number of graphs. The semidefinite programs (SDPs) arising from this hierarchy involve large matrix variabl…
Revisiting the convergence rate of the Lasserre hierarchy for polynomial optimization over the hypercube
Sander Gribling, Etienne de Klerk, Juan Vera
We revisit the problem of minimizing a given polynomial on the hypercube . Lasserre's hierarchy (also known as the moment- or sum-of-squares hierarchy) provides a seq…