MATLAB codes for Anderson acceleration for the alternating projections
method for the nearest correlation matrix problem, based on the paper
Nicholas J. Higham and Nataša Strabić. Anderson acceleration of the
alternating projections method for computing the nearest correlation
matrix. MIMS EPrint 2015.39, Manchester Institute for Mathematical
Sciences, The University of Manchester, UK, August 2015. 22 pp.
Nick Higham (2020). higham/anderson-accel-ncm (https://www.github.com/higham/anderson-accel-ncm), GitHub. Retrieved .
For numbers of iterations and timings see the paper https://doi.org/10.1007/s11075-015-0078-3 (which is the published version of the eprint quoted above).
Can you help me? What is the difference in number of iterations and time between Anderson acceleration for APM and original APM?
The comments say "If PATTERN is non-empty then the unit diagonal must be explicitly forced if required", so you have to provide a matrix with unit diagonal in that case.
This function is not intended for covariance matrices.
[1,1;1,1] is a correlation matrix, so is an acceptable output.
How can I make this code work with my covariance matrix (not Correlation one)? However, it doesn't output with error, when I try to run it with, for example, [1,2;2,3], but it still doesn't work properly - it output with [1,1;1,1], which is obviously not appropriate for nearest covariance matrix problem. Lookin forward to your answer.