A. SHAPIRO and J.D. BOTHA. Dual algorithms for orthogonal Procrustes rotations. SIAM J. Matrix Anal. Appl., 9(3):378-383, 1988. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Note on Lack of Strong duality for Quadratic Problems with.. - Wolkowicz (1999) (Correct)
....XX T = I; 1) where A; B are n Theta n symmetric matrices and C is n Theta n: This constraint set is often called the Stiefel manifold, 12] If the objective function is written as jjAY Gamma XBjj 2 ; with both X;Y orthogonal, then this is the orthogonal Procrustes Problem. See e.g. [10, 5, 12] for references, theory, and applications. In [2] the authors study (1) in the special case that C = 0; i.e. the homogeneous case. These problems arise as orthogonal relaxations of the quadratic assignment and graph partitioning problems. It is shown that the resulting, well known, eigenvalue ....
A. SHAPIRO and J.D. BOTHA. Dual algorithms for orthogonal Procrustes rotations. SIAM J. Matrix Anal. Appl., 9(3):378--383, 1988. 14
Unknown - Lack Of Strong (Correct)
No context found.
A. SHAPIRO and J.D. BOTHA. Dual algorithms for orthogonal Procrustes rotations. SIAM J. Matrix Anal. Appl., 9(3):378-383, 1988.
Semidefinite and Cone Programming Bibliography/Comments - Wolkowicz (2004) (Correct)
No context found.
A. SHAPIRO and J.D. BOTHA. Dual algorithms for orthogonal Procrustes rotations. SIAM J. Matrix Anal. Appl., 9(3):378--383, 1988.
Optimality Conditions and Duality Theory for Minimizing.. - Overton And Womersley (1993) (35 citations) (Correct)
No context found.
A. Shapiro and J. D. Botha (1988), "Dual algorithms for orthogonal procrustes rotations", SIAM Journal on Matrix Analysis 9, pp. 378-383.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC