Abstract
Low-rank approximation of a correlation matrix is a constrained minimization problem that can be translated into a minimization–maximization problem by the method of Lagrange multiplier. In this paper, we solve the inner maximization problems with a single spectral decomposition, and the outer minimization problems with gradient-based descending methods. An in-depth analysis is done to characterize the solutions of the inner maximization problem for the case when they are non-unique. The well-posedness of the Lagrange multiplier problem and the convergence of the descending methods are rigorously justified. Numerical results are presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.