Abstract

This paper reviews some properties of the set of vectors with autocorrelated components. This set appears in some signal processing problems, in particular filter synthesis or statistical estimation. It turns out to be a closed convex cone enjoying several representations and various geometrical properties. The aim of this paper is to gather different aspects of the geometry of this cone. We adopt a convex analysis point of view to present known and new results.

Author information

Contact details are reproduced from the original publication and may be historical.

Keywords

  • Convex analysis
  • autocorrelation
  • nonnegative trigonometric polynomials

References

  1. B. Alkire, L. Vandenberghe: Convex optimization problems involving finite autocorrelation sequences, Math. Program., Ser. A 93 (2002) 331–359.https://doi.org/10.1007/s10107-002-0334-xGoogle Scholar
  2. A. Barvinok: A Course in Convexity, Graduate Studies in Mathematics 54, American Mathematical Society, Providence (2002).https://doi.org/10.1090/gsm/054Google Scholar
  3. A. Ben-Tal, A. Nemirovski: Lectures on Modern Convex Optimization. Analysis, Algorithms, and Engineering Applications, MPS/SIAM Series on Optimization 2, SIAM, Philadelphia (2002).https://doi.org/10.1137/1.9780898718829Google Scholar
  4. E. O. Brigham: The Fast Fourier Transform and its Applications, Prentice Hall, Englewood Cliffs (1988).Google Scholar
  5. P. Butler, A. Cantoni: Eigenvalues and eigenvectors of symmetric centrosymmetric matrices, Linear Algebra Appl. 13 (1976) 275–288.https://doi.org/10.1016/0024-3795(76)90101-4Google Scholar
  6. C. I. Byrnes, A. Lindquist: A convex optimization approach to generalized moment problems, in: Control and Modeling of Complex Systems (Tokyo, 2001), K. Hashimoto et al. (ed.), Trends Math., Birkhäuser, Boston (2003) 3–21.https://doi.org/10.1007/978-1-4612-0023-9_1Google Scholar
  7. A. Böttcher, B. Silbermann: Introduction to Large Truncated Toeplitz Matrices, Springer, New York (1999).https://doi.org/10.1007/978-1-4612-1426-7Google Scholar
  8. A. Cadzow, Y. Sun: Sequences with positive semidefinite Fourier transforms, IEEE Trans. Acoust. Speech Signal Process. 34(6) (1986) 1502–1510.https://doi.org/10.1109/TASSP.1986.1164990Google Scholar
  9. M. Chu, H. Golub: Inverse Eigenvalue Problems: Theory, Algorithms, and Applications, Numerical Mathematics and Scientific Computation, Oxford University Press, Oxford (2005).https://doi.org/10.1093/acprof:oso/9780198566649.003.0002Google Scholar
  10. T. Davidson, Z. Luo, J. Sturm: Linear matrix inequality formulation of spectral mask constraints with applications to FIR filter design, IEEE Trans. Signal Process. 50(11) (2002) 2702–2715.https://doi.org/10.1109/TSP.2002.804079Google Scholar
  11. P. Delsarte, Y. Genin: Spectral properties of finite Toeplitz matrices, in: Mathematical Theory of Networks and Systems (Beer Sheva, 1983), Lecture Notes in Control and Inform. Sci. 58, Springer, London (1984) 194–213.https://doi.org/10.1007/BFb0031053Google Scholar
  12. M. Dritschel: On factorization of trigonometric polynomials, Integral Equations Oper. Theory 49 (2004) 11–42.https://doi.org/10.1007/s00020-002-1198-4Google Scholar
  13. B. Dumitrescu: Trigonometric polynomials positive on frequency domains and applications to 2-D FIR filter design, IEEE Trans. Signal Process. 54(11) (2006) 4282–4292.https://doi.org/10.1109/TSP.2006.880218Google Scholar
  14. B. Dumitrescu: Positive Trigonometric Polynomials and Signal Processing Applications, Springer, Dordrecht (2007).Google Scholar
  15. B. Dumitrescu, I. Tabus, P. Stoica: On the parametrization of positive real sequences and MA parameter estimation, IEEE Trans. Signal Process. 49 (2001) 2630–2639.https://doi.org/10.1109/78.960409Google Scholar
  16. L. Faybusovich: Semidefinite descriptions of cones defining spectral mask constraints, Eur. J. Oper. Res. 129(3) (2006) 1207–1221.https://doi.org/10.1016/j.ejor.2004.12.025Google Scholar
  17. M. Fuentes: Analyse et Optimisation de Problèmes sous Contraintes d’Autocorrélation, Université Paul Sabatier, Toulouse III (2007).Google Scholar
  18. M. Fuentes: Diagonalization of the symmetrized discrete ith right shift operator: an elementary proof, Numer. Algorithms 44 (2007) 29–43.https://doi.org/10.1007/s11075-007-9076-4Google Scholar
  19. G. H. Golub, C. F. van Loan: Matrix Computations, 3rd Ed., Johns Hopkins Studies in the Mathematical Sciences, Johns Hopkins University Press, Baltimore (1996).Google Scholar
  20. D. Gorsich, M. Genton, G. Strang: Eigenstructures of spatial design matrices, J. Multivariate Anal. 80 (2002) 138–165.https://doi.org/10.1006/jmva.2000.1976Google Scholar
  21. D. Gourion, A. Seeger: Deterministic and random methods for computing volumetric moduli of convex cones, submitted (2008).Google Scholar
  22. R. L. Graham, D. E. Knuth, O. Patashnik: Concrete Mathematics, 2nd Ed., Addison-Wesley, Reading (1994).Google Scholar
  23. U. Grenander, G. Szegő: Toeplitz Forms and their Applications, 2nd Ed., Chelsea, New York (1984).Google Scholar
  24. Y. Hachez: Convex Optimization over Non-Negative Polynomials: Structured Algorithms and Applications, PhD Thesis, Université Catholique de Louvain (2003).Google Scholar
  25. Y. Hachez, H. Woerdeman: Approximating sums of squares with a single square, Linear Algebra Appl. 399 (2005) 187–201.https://doi.org/10.1016/j.laa.2004.10.005Google Scholar
  26. J.-B. Hiriart-Urruty, C. Lemaréchal: Convex Analysis and Minimization Algorithms. Part 1: Fundamentals, Springer, Berlin (1993).https://doi.org/10.1007/978-3-662-02796-7_1Google Scholar
  27. S. Karlin, W. J. Studden: Tchebycheff Systems: With Applications in Analysis and Statistics, Interscience, New York (1966).Google Scholar
  28. M. G. Krein, A. A. Nudelman: The Markov Moment Problem and Extremal Problems, Translations of Mathematical Monographs 50, American Mathematical Society, Providence (1977).https://doi.org/10.1090/mmono/050Google Scholar
  29. J. B. Lasserre: Global optimization with polynomials and the problem of moments, SIAM J. Optim. 11 (2001) 796–817.https://doi.org/10.1137/S1052623400366802Google Scholar
  30. A. Megretski: Positivity of trigonometric polynomials, in: Proc. 42nd IEEE Conf. Decision Control (2003) 3814–3817.https://doi.org/10.1109/CDC.2003.1271743Google Scholar
  31. Y. Nesterov: Squared functional systems and optimization problems, in: High Performance Optimization, H. Frenk et al. (ed.), Kluwer, Dordrecht (2000) 405–440.https://doi.org/10.1007/978-1-4757-3216-0_17Google Scholar
  32. A. Oppenheim, A. Willsky, I. Young: Signals and Systems, Prentice-Hall, London (1983).Google Scholar
  33. P. A. Parillo: Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization, PhD Thesis, California Institute of Technology, Pasadena (2000).Google Scholar
  34. T. Roh, B. Dumitrescu, L. Vandenberghe: Multidimensional FIR filter design via trigonometric sum-of-squares optimization, IEEE J. Sel. Topics Signal Process. 1 (2007) 641–650.https://doi.org/10.1109/JSTSP.2007.910261Google Scholar
  35. W. Rudin: Fourier Analysis on Groups, Interscience Tracts in Pure and Applied Mathematics 12, Interscience, New York (1962).Google Scholar
  36. A. Stoica, R. Moses, P. Stoica: Enforcing positiveness on estimated spectral densities, Electron. Lett. 29 (1993) 2009–2011.https://doi.org/10.1049/el:19931340Google Scholar

Suggested citation

M. Fuentes. “Properties of the Convex Cone of Vectors with Autocorrelated Components.” Journal of Convex Analysis 17 (2010), No. 2, 381–403. https://doi.org/10.68381/jca17027

Download BibTeXPublished by Heldermann Verlag.

Published by Heldermann Verlag, 2010. Rights now held by Banach Press LLC.