Application of Alternating Convex Projection Methods for Computation of Positive Toeplitz Matrices

IEEE Transactions on Signal Processing

Volumn 42, Issue 7, 1994, Pages 1873-1875

  Grigoriadis, Karolos M ^a   Frazho, Arthur E ^a   Skelton, Robert E ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; CONCENTRATION (PROCESS); CONSTRAINT THEORY; CONTROL THEORY; MATHEMATICAL OPERATORS; MATRIX ALGEBRA; OPTIMIZATION;

ALTERNATING CONVEX PROJECTION METHODS; POSITIVE TOEPLITZ MATRICES;

SIGNAL PROCESSING;

EID: 0028467590     PISSN: 1053587X     EISSN: 19410476     Source Type: Journal    
DOI: 10.1109/78.298303     Document Type: Article

References (14)

1. C. W. Therrien, Discrete Random Signals and Statistical Signal Processing. Englewood Cliffs, NJ: Prentice Hall, 1992.
2. R. E. Skelton, “The jury test and covariance control,” in Proc. Symp. Fundamentals Discrete-Time Syst. (Chicago), 1992.
3. D. C. Youla and H. Webb, “Image restoration by the method of convex projections: Part 1—Theory,” IEEE Trans. Med. Imag., vol. 1, no. 2, pp. 81–94, 1982.
4. K. M. Grigoriadis and R. E. Skelton, “Alternating convex projection methods for covariance control design,” in Proc. 30th Allerton Conf. Commun. Contr. Comp. (Monticello, IL), 1992; also, Int. J. Contr., to appear.
5. N. J. Higham, “Computing the nearest symmetric positive semidefinite matrix,” Linear Algebra Appl., vol. 103, pp. 103–118, 1988.
6. W. Cheney and A. A. Goldstein, “Proximity maps for convex sets,” Proc. Amer. Math. Soc., vol. 12, pp. 448–450, 1959.
7. L. G. Gubin, B. T. Polyak, and E. V. Raik, “The method of projections for finding the common point of convex sets,” USSR Computat. Math. Math. Phys., vol. 7, pp. 1–24, 1967.
8. J. P. Boyle and R. L. Dykstra, “A method for finding projections onto the intersection of convex sets in Hilbert space,” Lecture Notes in Statistics, vol. 37, 28–47, 1986.
9. S. -P. Han, “A successive projection method,” Math. Programming, vol. 40, pp. 1–14, 1988.
10. D. C. Youla and V. Velasco, “Extensions of a result on the synthesis of signals in the presence of inconsistent constraints,” IEEE Trans. Circ. Syst., vol. CAS-33, no. 4, 1986.
11. A. V. Balakrishnan, Applied Functional Analysis. New York: Springer-Verlag, 1981, second ed.
12. J. E. Kelly, “The cutting-plane algorithm for solving convex programs,” J. Soc. Indust. Appl. Math., vol. 8, no. 4, pp. 703–712, 1960.
13. R. G. Bland, D. Goldfarb, and M. J. Todd, “The ellipsoid method: A survey,” Oper. Res., vol. 29, no. 6, pp. 1039–1091, 1981.
14. M. Grotschel, L. Lovasz, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization. New York: Springer-Verlag, 1988.