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

Research output: Working paperOther 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.

Engineering & Materials Science