Dykstra's algorithm for a constrained least-squares matrix problem

Numerical Linear Algebra with Applications

Volumn 3, Issue 6, 1996, Pages 459-471

  Escalante, René ^a   Raydan, Marcos ^a  

^a FACULTAD DE CIENCIAS   (Venezuela)

Author keywords

Alternating projection method; Constrained least squares; Dykstra's algorithm; Patterned matrix

Indexed keywords

EID: 21444443737     PISSN: 10705325     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1099-1506(199611/12)3:6<459::AID-NLA82>3.0.CO;2-S     Document Type: Article

References (16)

1. J. C. Allwright. Positive semidefinite matrices: characterization via conical hulls and least-squares solution of a matrix equation. SIAM J. Control and Opt., 26, 537-555, 1988.
2. E. Anderson, Z. Bai, C. Bischof, J. Demmel, J. Dongarra, J. du Croz, A. Greenbaum, S. Hammarling, A. Mckenney, S. Ostrouchov and D. Sorensen. LAPACK User's Guide. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1992.
3. H. H. Bauschke and J. M. Borwein. Dykstra's alternating projection algorithm for two sets. J. Approx. Theory, 79, 418-443, 1994.
4. J. P. Boyle and R. L. Dykstra. A method for finding projections onto the intersections of convex sets in Hubert spaces. Lecture Notes in Statistics, 37, 28-47, 1986.
5. W. Cheney and A. Goldstein. Proximity maps for convex sets. Proc. Amer. Math. Soc., 10, 448-450, 1959.
6. G. B. Dantzig. Deriving a utility function for the economy. Technical Report SOL 85-6R, Department of Operations Research, Stanford University, Stanford, CA, 1985.
7. F. Deutsch. The method of alternating orthogonal projections. In S.P. Singh, editor, Approximation Theory, Spline Functions and Applications, pages 105-121, Kluwer Academic Publishers, Netherlands, 1992.
8. F. Deutsch and H. Hundal. The rate of convergence of Dykstra's cyclic projections algorithm: the polyhedral case. Numer. Funct. Anal. and Optimiz., 15, 537-565, 1994.
9. R. L. Dykstra. An algorithm for restricted least-squares regression. J. Amer. Stat. Assoc., 78, 837-842, 1983.
10. W. Glunt, T. L. Hayden, S. Hong and J. Wells. An alternating projection algorithm for computing the nearest Euclidean distance matrix. SIAM J. Matrix Anal. Appl., 11, 589-600, 1990.
11. S. P. Han. A succesive projection method. Math. Programming, 40, 1-14, 1988.
12. T. L. Hayden and J. Wells. Approximation by matrices positive semidefinite on a subspace. Linear Algebra Appl., 109, 115-130, 1988.
13. N. J. Higham. Computing a nearest symmetric positive semidefinite matrix. Linear Algebra Appl., 103, 103-118, 1988.
14. H. Hu. Positive definite constrained least-squares estimation of matrices. Linear Algebra Appl., 229, 167-174, 1995.
15. H. Hu and I. Olkin. A numerical procedure for finding the positive definite matrix closest to a patterned matrix. Statistics and Probability letters, 12, 511-515, 1991.
16. J. von Neumann. Functional Operators Vol. II. The Geometry of Orthogonal Spaces. Annals of Math. Studies, vol. 22, 1950. Princeton University Press. This is a reprint of mineographed lecture notes first distributed in 1933.