Analysis of a Quadratic Programming Decomposition Algorithm

Analysis of a Quadratic Programming Decomposition Algorithm: "G. Bencteux, E. Cances, W. W. Hager, and C. Le Bris

We analyze a decomposition algorithm for minimizing a quadratic objective function, separable in $\mathbf{x}_1$ and $\mathbf{x}_2$, subject to the constraint that $\mathbf{x}_1$ and $\mathbf{x}_2$ are orthogonal vectors on the unit sphere. Our algorithm consists of a local step where we minimize th ... [SIAM J. Numer. Anal. 47, 4517 (2010)] published Wed Feb 17, 2010."