Sums of random symmetric matrices and quadratic optimization under orthogonality constraints |
| |
Authors: | Arkadi Nemirovski |
| |
Affiliation: | (1) ISYE, Georgia Institute of Technology, 765 Ferst Drive NW, Atlanta, GA 30332-0205, USA |
| |
Abstract: | Let B i be deterministic real symmetric m × m matrices, and ξ i be independent random scalars with zero mean and “of order of one” (e.g., ). We are interested to know under what conditions “typical norm” of the random matrix is of order of 1. An evident necessary condition is , which, essentially, translates to ; a natural conjecture is that the latter condition is sufficient as well. In the paper, we prove a relaxed version of this conjecture, specifically, that under the above condition the typical norm of S N is : for all Ω > 0 We outline some applications of this result, primarily in investigating the quality of semidefinite relaxations of a general quadratic optimization problem with orthogonality constraints , where F is quadratic in X = (X 1,... ,X k ). We show that when F is convex in every one of X j , a natural semidefinite relaxation of the problem is tight within a factor slowly growing with the size m of the matrices . Research was partly supported by the Binational Science Foundation grant #2002038. |
| |
Keywords: | Large deviations Random perturbations of linear matrix inequalities Semidefinite relaxations Orthogonality constraints Procrustes problem |
本文献已被 SpringerLink 等数据库收录! |
|