Computation of symmetric positive definite Toeplitz matrices by the hybrid steepest descent method

Signal Processing

Volumn 83, Issue 5, 2003, Pages 1135-1140

  Slavakis, Konstantinos ^a   Yamada, Isao ^a   Sakaniwa, Kohichi ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONTROL THEORY; MATRIX ALGEBRA;

HYBRID STEEPEST DESCENT METHOD;

SIGNAL PROCESSING;

EID: 0037401345     PISSN: 01651684     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0165-1684(03)00002-1     Document Type: Article

References (26)

1. Bauschke H.H., Borwein J.M. On projection algorithms for solving convex feasibility problems. SIAM Rev. 38(3):1996;367-426.
2. Boyle J.P., Dykstra R.L. A method for finding projections onto the intersection of convex sets in Hilbert space. Lecture Notes in Statist. 37:1986;28-47.
3. Bregman L.M. The method of successive projections for finding a common point of convex sets. Soviet Math. Dokl. 6:1965;688-692.
4. Cheney W., Goldstein A.A. Proximity maps for convex sets. Proc. Amer. Math. Soc. 10(3):1959;448-450.
5. Combettes P.L. The foundations of set theoretic estimation. Proc. IEEE. 81(2):1993;182-208.
6. Combettes P.L. Inconsistent signal feasibility problems. least-squares solutions in a product space IEEE Trans. Signal Process. 42(11):1994;2955-2966.
7. Combettes P.L. Strong convergence of block-iterative outer approximation methods for convex optimization. SIAM J. Control Optim. 38(2):2000;538-565.
8. Combettes P.L., Bondon P. Hard-constrained inconsistent signal feasibility problems. IEEE Trans. Signal Process. 47(9):1999;2460-2468.
9. Deutsch F., Yamada I. Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings. Numer. Funct. Anal. Optim. 19:1998;33-56.
10. Ekeland I., Temam R. Convex Analysis and Variational Problems. 1976;North-Holland, Amsterdam.
11. Golub G.H., Loan C.F.V. Matrix Computations. 3rd Edition:1996;The John Hopkins University Press, Baltimore, MD.
12. Grigoriadis K.M., Frazho A.E., Skelton R.E. Application of alternating convex projection methods for computation of positive Toeplitz matrices. IEEE Trans. Signal Process. 42(7):1994;1873-1875.
13. Grigoriadis K.M., Skelton R.E. Alternating convex projection methods for discrete-time covariance control design. J. Optim. Appl. 88(2):1996;399-432.
14. Gubin L.G., Polyak B.T., Raik E.V. The method of projections for finding the common point of convex sets. USSR Comput. Math. Phys. 7:1967;1-24.
15. Higham N.J. Computing a nearest symmetric positive semidefinite matrix. Linear Algebra Appl. 103:1988;103-118.
16. Iusem A.N., De Pierro A. On the convergence of Han's method for convex programming with quadratic objective. Math. Programming. 52:1991;265-284.
17. Lions P.L. Approximation de points fixes de contractions. C.R. Acad. Sci. Paris Sèrie A-B. 284:1977;1357-1359.
18. Ogura N., Yamada I. Non-strictly convex minimization over the fixed point set of an asymptotically shrinking nonexpansive mapping. Numer. Funct. Anal. Optim. 23(1&2):2002;113-137.
19. Porat B. Digital Processing of Random Signals: Theory and Methods. 1993;Prentice-Hall, Englewood Cliffs, NJ.
20. K. Slavakis, I. Yamada, K. Sakaniwa, Spectrum estimation of real vector wide sense stationary processes by the Hybrid Steepest Descent Method, in: Proceedings of the ICASSP, Orlando, 2002.
21. Stark H., Yang Y. Vector Space Projections: A Numerical Approach to Signal and Image Processing, Neural Nets, and Optics. 1998;Wiley, New York.
22. Wittmann R. Approximation of fixed points of nonexpansive mappings. Arch. Math. 58:1992;486-491.
23. Yamada I. The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of non-expansive mappings. Butnariu D., Censor Y., Reich S. Inherently Parallel Alg. in Feasibility and Optimization and Their Application. 2001;473-504 North-Holland, Amsterdam.
24. Yamada I., Ogura N., Yamashita Y., Sakaniwa K. Quadratic optimization of fixed points of nonexpansive mappings in Hilbert space. Numer. Funct. Anal. Optim. 19:1998;165-190.
25. Yamada I., Ogura N. Shirakawa N. A numerically robust hybrid steepest descent method for the convexly constrained generalized inverse problems. Contemp. Math. 313:2002;269-305.
26. Zeidler E. Nonlinear Functional Analysis and Its Applications I: Fixed Point Theorems. 1986;Springer, New York.