Abstract
In this paper, we present a general method for rank-constrained optimization. We use an iterative convex optimization procedure where it is possible to include any extra convex constraints. The proposed approach has potential application in several areas. We focus on the problem of Factor Analysis. In this case, our approach provides sufficient flexibility to handle correlated errors. The benefits of the method is demonstrated via a simulation study.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
