Simulated Annealing with Hit-and-Run for Convex Optimization: Rigorous Complexity Analysis and Practical Perspectives for Copositive Programming

Riley Badenbroek, Etienne de Klerk

Research output: Working paper › Other research output

Fingerprint

Dive into the research topics of 'Simulated Annealing with Hit-and-Run for Convex Optimization: Rigorous Complexity Analysis and Practical Perspectives for Copositive Programming'. Together they form a unique fingerprint.

Keyphrases

Mathematics