Jordan-algebraic aspects of optimization:randomization

Leonid Faybusovich(leonid.faybusovich.1nd.edu)

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

Keywords: Symmetric relaxations, Randomization

Category 1: Linear, Cone and Semidefinite Programming

Citation: Preprint, June 2007

Download: [PDF]

Entry Submitted: 07/07/2007
Entry Accepted: 07/07/2007
Entry Last Modified: 07/07/2007

Modify/Update this entry