Abstract
This paper addresses the positive semi-deffnite procrustes problem (PSDP). The PSDP corresponds to a least squares problem over the set of symmetric and semi-deffnite positive matrices. These kinds of problems appear in many applications such as structure analysis, signal processing, among others. A non-monotone spectral projected gradient algorithm is proposed to obtain a numerical solution for the PSDP. The proposed algorithm employs the Zhang and Hager's non-monotone technique in combination with the Barzilai and Borwein's step size to accelerate convergence. Some theoretical results are presented. Finally, numerical experiments are performed to demonstrate the effectiveness and efficiency of the proposed method, and comparisons are made with other state-of-the-art algorithms.
Publisher
Universidad Nacional de Colombia
Reference18 articles.
1. Lars-Erik Andersson and Tommy Elfving, A constrained procrustes problem, SIAM Journal on Matrix Analysis and Applications 18 (1997), no. 1, 124-139.
2. Negin Bagherpour and Nezam Mahdavi-Amiri, Efficient algorithms for positive semi-definite total least squares problems, minimum rank problem and correlation matrix computation, arXiv preprint arXiv:1407.3894 (2014).
3. Jonathan Barzilai and Jonathan M Borwein, Two-point step size gradient methods, IMA journal of numerical analysis 8 (1988), no. 1, 141-148.
4. Dimitri P Bertsekas, Nonlinear programming, Journal of the Operational Research Society 48 (1997), no. 3, 334-334.
5. John E Brock, Optimal matrices describing linear systems., AIAA Journal 6 (1968), no. 7, 1292-1296.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献