A successive projection method
Mathematical Programming: Series A and B
On the reducibility of centrosymmetric matrices—applications in engineering problems
Circuits, Systems, and Signal Processing
Dykstra's alternating projection algorithm for two sets
Journal of Approximation Theory
SIAM Journal on Matrix Analysis and Applications
Generalized Reflexive Matrices: Special Properties and Applications
SIAM Journal on Matrix Analysis and Applications
Robust Stopping Criteria for Dykstra's Algorithm
SIAM Journal on Scientific Computing
SIAM Journal on Matrix Analysis and Applications
Hi-index | 5.23 |
In this work we apply Dykstra's alternating projection algorithm for minimizing @?AX-B@? where @?@?@? is the Frobenius norm and A@?R^m^x^n, B@?R^m^x^n and X@?R^n^x^n are doubly symmetric positive definite matrices with entries within prescribed intervals. We first solve the constrained least-squares matrix problem by using the special structure properties of doubly symmetric matrices, and then use the singular value decomposition to transform the original problem into a simpler one that fits nicely with the algorithm originally developed by [R. Escalante, M. Raydan, Dykstra's algorithm for a constrained least-squares matrix problem, Numer. Linear Algebra Appl. 3 (1996) 459-471].