42 citations · 42 across the 4 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.OC2019
Minimum energy configurations on a toric lattice as a quadratic assignment problem
Daniel Brosch, Etienne de Klerk
We consider three known bounds for the quadratic assignment problem (QAP): an eigenvalue, a convex quadratic programming (CQP), and a semidefinite programming (SDP) bound. Since th…
math.OC2019
Simulated annealing with hit-and-run for convex optimization: rigorous complexity analysis and practical perspectives for copositive programming
Riley Badenbroek, Etienne de Klerk
We give a rigorous complexity analysis of the simulated annealing algorithm by Kalai and Vempala [Math of OR 31.2 (2006): 253-266] using the type of temperature update suggested by…