Dykstra's Algorithm for a Constrained Least-squares Matrix Problem

From MaRDI portal





We apply Dykstra's alternating projection algorithm [\textit{R. L. Dykstra}, J. Am. Stat. Assoc. 78, 837-842 (1983; Zbl 0535.62063); \textit{J. P. Boyle} and \textit{R. L. Dykstra}, Lect. Notes Stat. 37, Springer-Verlag, 28-47 (1986; Zbl 0603.49024)] to the constrained least-squares matrix problem that arises naturally in statistics and mathematical economics. In particular, we are concerned with the problem of finding the closest symmetric positive definite bounded and patterned matrix, in the Frobenius norm, to a given matrix. In this work, we state the problem as the minimization of a convex function over the intersection of a finite collection of closed and convex sets in the vector space of square matrices. We present iterative schemes that exploit the geometry of the problem, and for which we establish convergence to the unique solution. Finally, we present preliminary numerical results to illustrate the performance of the proposed iterative methods.











This page was built for publication: Dykstra's Algorithm for a Constrained Least-squares Matrix Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4220442)