Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
- 19 September 2006
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 109 (2-3) , 283-317
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- On tractable approximations of randomly perturbed convex constraints2004
- On Lagrangian Relaxation of Quadratic Matrix ConstraintsSIAM Journal on Matrix Analysis and Applications, 2000
- Handbook of Semidefinite Programming2000
- On maximization of quadratic form over intersection of ellipsoids with common centerMathematical Programming, 1999
- Semidefinite programming relaxations for the graph partitioning problemDiscrete Applied Mathematics, 1999
- The Geometry of Algorithms with Orthogonality ConstraintsSIAM Journal on Matrix Analysis and Applications, 1998
- Remarks on Talagrand’s deviation inequality for Rademacher functions1991
- Dual Algorithm for Orthogonal Procrustes RotationsSIAM Journal on Matrix Analysis and Applications, 1988
- Extremal problems on the set of nonnegative definite matricesLinear Algebra and its Applications, 1985
- A General Solution to Mosier's Oblique Procrustes ProblemPsychometrika, 1977