Dykstra's algorithm for constrained least-squares rectangular matrix problems

Computers and Mathematics with Applications

Volumn 35, Issue 6, 1998, Pages 73-79

  Escalante, R ^a   Raydan, M ^a  

^a FACULTAD DE CIENCIAS   (Venezuela)

Author keywords

Alternating projection methods; Constrained least squares; Dykstra's algorithm; Gerschgorin circles; Singular value descomposition

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; EIGENVALUES AND EIGENFUNCTIONS; LEAST SQUARES APPROXIMATIONS; MATRIX ALGEBRA; OPTIMIZATION; PROBLEM SOLVING;

ALTERNATING PROJECTION METHOD; DYKSTRAS ALGORITHM; GERSCHGORIN CIRCLES; SINGULAR VALUE DECOMPOSITION;

ALGORITHMS;

EID: 0032020828     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0898-1221(98)00020-0     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. L.E. Andersson and T. Elfving, A constrained Procrustes problem, SIAM J. Matrix Anal. Appl. 18, 124-139, (1997).
3. T.L. Hayden and J. Wells, Approximation by matrices positive semidefinite on a subspace, Linear Algebra Appl. 109, 115-130, (1988).
4. N.J. Higham, Computing a nearest symmetric positive semidefinite matrix, Linear Algebra Appl. 103, 103-118, (1988).
5. N.J. Higham, The symmetric Procrustes problem, BIT 28, 133-143, (1988).
6. 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).
7. T.J. Suffridge and T.L. Hayden, Approximation by a Hermitian positive semidefinite Toeplitz matrix, SIAM J. Matrix Anal. Appl. 14, 721-734, (1993).
8. H. Hu, Positive definite constrained least-squares estimation of matrices, Linear Algebra Appl. 229, 167-174, (1995).
9. E. Escalante and M. Raydan, Dykstra's algorithm for a constrained least-squares matrix problem, Num. Linear Algebra Appl. 3 (6), 459-471, (1996).
10. J.P. Boyle and R.L. Dykstra, A method for finding projections onto the intersections of convex sets in Hilbert spaces, Lecture Notes in Statistics 37, 28-47, (1986).
11. R.L. Dykstra, An algorithm for restricted least-squares regression, J. Amer. Stat. Assoc. 78, 837-842, (1983).
12. 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).
13. H.H. Bauschke and J.M. Borwein, On projection algorithms for solving convex feasibility problems, SIAM Review 38, 367-426, (1996).
14. F. Deutsch, The method of alternating orthogonal projections, In Approximation Theory, Spline Functions and Applications, (Edited by S.P. Singh), pp. 105-121, Kluwer Academic Publishers, Netherlands, (1992).
15. G.H. Golub and C.F. Van Loan, Matrix Computations, Johns Hopkins University Press, Baltimore, MD, (1989).
16. 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).