Dykstra's Algorithm for a Constrained Least-squares Matrix Problem
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.
- Dykstra's algorithm for constrained least-squares rectangular matrix problems
- Dykstra's algorithm for constrained least-squares doubly symmetric matrix problems
- A new algorithm for constrained matrix least squares approximations
- Solving linearly constrained matrix least squares problem by LSQR
- scientific article; zbMATH DE number 686914
- Algorithms for quadratic constrained matrix problems
- Algorithm for inequality-constrained least squares problems
- An efficient method for solving a matrix least squares problem over a matrix inequality constraint
- A lagrangean relaxation algorithm for the constrained matrix problem
- An iterative approach to a constrained least squares problem
- Dykstra's algorithm for constrained least-squares rectangular matrix problems
- On first order optimality conditions for vector optimization
- Computational acceleration of projection algorithms for the linear best approximation problem
- An iteration method to solve multiple constrained least squares problems
- Dykstras algorithm with bregman projections: A convergence proof
- Computing the nearest diagonally dominant matrix
- A new iterative algorithm for solving a class of matrix nearness problem
- On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors
- scientific article; zbMATH DE number 1916748 (Why is no real title available?)
- A constrained matrix least-squares problem in structural dynamics model updating
- The proximal point iterative algorithm for the generalized positive semidefinite least squares problem
- Un problème d'approximation matricielle : quelle est la matrice bistochastique la plus proche d'une matrice donnée ?
- A new algorithm for constrained matrix least squares approximations
- An acceleration scheme for Dykstra's algorithm
- Dykstra's algorithm for constrained least-squares doubly symmetric matrix problems
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)