@article {IOPORT.05798637,
    author       = {Faybusovich, L.},
    title        = {Jordan-algebraic aspects of optimization: randomization.},
    year         = {2010},
    journal      = {Optimization Methods \& Software},
    volume       = {25},
    number       = {5},
    issn         = {1055-6788},
    pages        = {763-779},
    publisher    = {Taylor \& Francis, Reading, Berkshire},
    doi          = {10.1080/10556780903033771},
    abstract     = {In the first part of this paper the author discusses Jordan-algebraic concepts and proves properties of some probability measures on cones in a Jordan algebra. In the second part of this paper he uses those results and gives some explicit estimations comparing the values of (combinatorial or other nonconvex) optimization problems on cones in Jordan algebras and their randomization (symmetric relaxation). His results generalize already existing results of for instance {\it A. So, Y. Ye} and {\it J. Zhang} [Math. Oper. Res. 33, No. 4, 910--920 (2008 Zbl 1218.90153)] or {\it S. He, Z.-Q. Luo, J. Nie} and {\it S. Zhang} [SIAM J. Optim. 19, No. 2, 503--523 (2008; Zbl 1180.90218)].},
    reviewer     = {Alfred G\"opfert (Halle)},
    identifier   = {05798637},
}