Jordan-algebraic aspects of optimization:randomization, Optim

Abstract We describe a version of randomization technique within a general framework of Euclidean Jordan algebras. It is shown how to use this technique to evaluate the quality of symmetric relaxations for several nonconvex optimization problems