References
- S. Al-Homidan and M. Alqarni, Structure methods for solving the nearest correlation matrix problem, Positivity 16 (2012), pp. 497–508.
- M.F. Ashby and R.H.J. David, Engineering Materials 2: An Introduction to Microstructures, Processing and Design, 3rd ed., Butterworth-Heinemann, Burlington, 2006.
- M. Brooke, Matrix Reference Manual. Available at http://www.psi.toronto.edu/matrix/calculus.html.
- S. Burer and R.D.C. Monteiro, Local minima and convergence in low-rank semidefinite programming, Math. Program. 103 (2005), pp. 427–444.
- M.T. Chu, R.E. Funderlic, and R.J. Plemmons, Structured low rank approximation, Linear Algebra Appl. 366 (2003), pp. 157–172.
- X.F. Duan, J.C. Bai, M.J. Zhang, and X.J. Zhang, On the generalized low rank approximation of the correlation matrices arising in the asset portfolio, Linear Algebra Appl. 461 (2014), pp. 1–17.
- R.L. Dykstra, An algorithm for restricted least squares regression, J. Amer. Statist. Assoc. 78 (1983), pp. 837–842.
- D. Gabay and B. Mercier, A dual algorithm for the solution of nonlinear variational problems via finite element approximation, Comput. Math. Appl. 2 (1976), pp. 17–40.
- Y. Gao and G. Church, Improving molecular cancer class discovery through sparse nonnegative matrix factorization, Bioinformatics 21 (2005), pp. 3970–3975.
- Y. Gao and D.F. Sun, A majorized penalty approach for calibrating rank constrained correlation matrix problems, Technical Report, Department of Mathematics, National University of Singapore, March 2010
- B.S. He, M.H. Xu, and X.M. Yuan, Solving large-scale least squares semidefinite programming by alternating direction methods, SIAM J. Matrix Anal. Appl. 32 (2011), pp. 136–152.
- H. Kim and H. Park, Nonnegative matrix factorization based on alternating nonnegativity constrained least squares and active set method, SIAM J. Matrix Anal. Appl. 30 (2008), pp. 713–730.
- C. Lawson and R.J. Hanson, Solving Least Squares Problems, Prentice-Hall, Englewood Cliffs, NJ, 1974.
- Q.N. Li, Alternating direction method for a class of constrained matrix approximation problems, Pac. J. Optim. 8 (2012), pp. 765–778.
- Q.N. Li and H.D. Qi, A sequential semismooth Newton method for the nearest low-rank correlation matrix problem, SIAM J. Optim. 21 (2011), pp. 1641–1666.
- J.F. Li, X.N. Zhang, Z.Y. Peng, and J.J. Peng, Alternating projection algorithm for single variable linear constraints matrix equation problems, Math. Numer. Sin. 36 (2014), pp. 143–162.
- C.J. Lin, Projected gradient methods for nonnegative matrix factorization, Neural Comput. 19 (2007), pp. 2756–2779.
- L. Lin, Alternative gradient algorithms with applications to nonnegative matrix factorizations, Appl. Math. Comput. 216 (2010), pp. 1763–1770.
- C. Liu, Foundations of MEMS, 2nd ed., China Machine Press, Beijing, 2011.
- I. Markovsky, Low Rank Approximation: Algorithms, Implementation, Applications, Springer-Verlag, New York, 2012.
- X.W. Mu and Y.L. Zhang, An alternating direction method for second-order conic programming, Comput. Oper. Res. 40 (2013), pp. 1752–1757.
- J.V. Neumann, Functional Operators. II. The Geometry of Orthogonal Spaces, Princeton University Press, Princeton, 1950.
- K. Otsuka and C.M. Wayman, Shape Memory Materials, Cambridge University Press, Cambridge, 1998.
- H. Park, L. Zhang, and J.B. Rosen, Low rank approximation of a Hankel matrix by structured total least norm, BIT 39 (1999), pp. 757–779.
- Y. Takane, F.W. Young, and J.D. Leeuw, Nonmetric individual differences multidimensional scaling: An alternating least squares method with optimal scaling features, Psychometrika 42 (1977), pp. 7–67.
- L. Wang, M.T. Chu, and B. Yu, Orthogonal low rank tensor approximation: Alternating least squares method and its global convergence, SIAM J. Matrix Anal. Appl. 36 (2015), pp. 1–19.
- Y.X. Yuan and W.Y. Sun, Optimization Theory and Methods, Science Press, Beijing, 2010.
- F.Z. Zhang, Matrix Theory: Basic Results and Techniques, Springer, New York, 2011.