Semidefinite programming, matrix decomposition, and radar code design

Convex Optimization in Signal Processing and Communications

Volumn 9780521762229, Issue , 2009, Pages 192-228

  Huang, Yongwei ^a   Maio, Antonio De ^b   Zhang, Shuzhong ^c  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b UNIVERSITY OF NAPLES FEDERICO II   (Italy)

^c CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); MATRIX ALGEBRA; OPTIMIZATION; QUADRATIC PROGRAMMING; RADAR; RADAR SIGNAL PROCESSING; SIGNAL PROCESSING;

DECOMPOSITION TECHNIQUE; NONCONVEX QUADRATIC OPTIMIZATION; POSITIVE SEMIDEFINITE MATRICES; QUADRATIC OPTIMIZATION PROBLEMS; QUADRATICALLY CONSTRAINED QUADRATIC PROGRAMMING; QUADRATICALLY CONSTRAINED QUADRATIC PROGRAMMING (QCQP); SEMI-DEFINITE PROGRAMMING; SEMI-DEFINITE PROGRAMMING RELAXATIONS;

OPTIMAL SYSTEMS;

EID: 78650188979     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511804458.007     Document Type: Chapter

References (48)

1. W. Ai, Y. Huang, and S. Zhang, “New results on Hermitian matrix rank-one decomposition, ” Mathematical Programming, 2009. DOI: 10.1007/s10107-009-0304-7.
2. A. d’Aspremont and S. Boyd, “Relaxations and randomized methods for nonconvex QCQPs, ” EE392o Class Notes, Stanford University, Autumn 2003.
3. A. Beck and Y. Eldar, “Strong duality in nonconvex optimization with two quadratic constraints, ” SIAM Journal on Optimization, vol. 17, no. 3, pp. 844–60, 2006.
4. M. R. Bell, “Information theory and radar waveform design, ” IEEE Transactions on Information Theory, vol. 39, no. 5, pp. 1578–97, 1993.
5. M. R. Bell, “Information theory of radar and sonar waveforms, ” in Wiley Encyclopedia of Electrical and Electronic Engineering, vol. 10, J. G. Webster, ed. New York, NY: Wiley- Interscience, 1999, pp. 180–90.
6. A. Ben-Tal and A. Nemirovski, Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications, Philadelphia, PA: MPS-SIAM. 2001.
7. A. Ben-Tal, A. Nemirovski, and C. Roos, “Extended matrix cube theorems with applications to μ-theory in control, ” Mathematics of Operations Research, vol. 28, no. 3, pp. 497–523, 2003.
8. A. Ben-Tal and M. Teboulle, “Hidden convexity in some nonconvex quadratically constrained quadratic programming, ” Mathematical Programming, vol. 72, pp. 51–63, 1996.
9. J. S. Bergin, P. M. Techau, J. E. Don Carlos, and J. R. Guerci, “Radar waveform optimization for colored noise mitigation, ” 2005 IEEE International Radar Conference, Alexandria, VA, May 9–12, 2005, pp. 149–54.
10. L. Bomer and M. Antweiler, “Polyphase Barker sequences, ” Electronics Letters, vol. 25, no. 23, pp. 1577–9, 1989.
11. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge: Cambridge University Press, 2004.
12. L. Brickman, “On the field of values of a matrix, ” in Proceedings of the American Mathematical Society, 1961, vol. 12, pp. 61–6.
13. M. R. Celis, J. E. Dennis, and R. A. Tapia, “A trust region algorithm for nonlinear equality constrained optimization, ” in Numerical Optimization. R. T. Boggs, R. H. Byrd, and R. B. Schnabel, Eds. Philadelphia, PA: SIAM. 1985, pp. 71–82.
14. A. N. D’Andrea, U. Mengali, and R. Reggiannini, “The modified Cramer–Rao bound and its application to synchronization problems, ” IEEE Transactions on Communications, vol. 42, no. 3, pp. 1391–9, 1994.
15. A. De Maio, S. De Nicola, Y. Huang, S. Zhang, and A. Farina, “Code design to optimize radar detection performance under accuracy and similarity constraints, ” IEEE Transactions on Signal Processing, vol. 56, no. 11, pp. 5618–29, 2008.
16. A. Farina, “Waveform Diversity: Past, Present, and Future, ” presented at the Third International Waveform Diversity & Design Conference, Plenary Talk, Pisa, June 2007.
17. A. Farina and S. Pardini, “A track-while-scan algorithm using radial velocity in a clutter environment, ” IEEE Transactions on Aerospace and Electronic Systems, vol. 14, no. 5, pp. 769–79, 1978.
18. A. Farina and F. A. Studer, “Detection with high resolution radar: great promise, big challenge, ” Microwave Journal, pp. 263–73, 1991.
19. A. L. Fradkov and V. A. Yakubovich, “The S-procedure and duality relations in nonconvex problems of quadratic programming, ” Vestnik Leningrad University, vol. 6, pp. 101–9, 1979. (In Russian 1973.)
20. M. Y. Fu, Z. Q. Luo, and Y. Ye, “Approximation algorithms for quadratic programming, ” Journal of Combinatorial Optimization, vol. 2, pp. 29–50, 1998.
21. J. B. G. Frenk, K. Roos, T. Terlaky, and S. Zhang, eds., High performance optimization. Dordrecht: Kluwer Academic Publishers, 2000.
22. B. Friedlander, “A Subspace Framework for Adaptive Radar Waveform Design, ” in Record of the Thirty-Ninth Asilomar Conference on Signals, Systems and Computers 2005, Pacific Grove, CA, Oct. 28–Nov. 1, 2005, pp. 1135–9.
23. M. Friese, “Polyphase Barker sequences up to length 36, ” IEEE Transactions on Information Theory, vol. 42, no. 4, pp. 1248–50, 1996.
24. D. A. Garren, A. C. Odom, M. K. Osborn, J. S. Goldstein, S. U. Pillai, and J. R. Guerci, “Fullpolarization matched-illumination for target detection and identification, ” IEEE Transactions on Aerospace and Electronic Systems, vol. 38, no. 3, pp. 824–37, 2002.
25. F. Gini and R. Reggiannini, “On the use of Cramer-Rao-like bounds in the presence of random nuisance parameters, ” IEEE Transactions on Communications, vol. 48, no. 12, pp. 2120–26, 2000.
26. J. S. Goldstein, I. S. Reed, and P. A. Zulch, “Multistage partially adaptive STAP CFAR detection algorithm, ” IEEE Transactions on Aerospace and Electronic Systems, vol. 35, no. 2, pp. 645–61, 1999.
27. F. Hausdorff, “Der wertvorrat einer bilinearform, ” Mathematische Zeitschrift, vol. 3, pp. 314–6, 1919.
28. S. M. He, Z.-Q. Luo, J. W. Nie, and S. Zhang, “Semidefinite relaxation bounds for indefinite homogeneous quadratic optimization, ” SIAM Journal on Optimization, vol. 19, no. 2, pp. 503–23, 2008.
29. R. A. Horn and C. R. Johnson, Matrix Analysis. Cambridge: Cambridge University Press, 1985.
30. R. A. Horn and C. R. Johnson, Topics in Matrix Analysis. New York: Cambridge University Press, 1991.
31. Y. Huang and S. Zhang, “Complex matrix decomposition and quadratic programming, ” Mathematics of Operations Research, vol. 32, no. 3, pp. 758–68, 2007.
32. S. Kay, “Optimal signal design for detection of point targets in stationary gaussian clutter/reverberation, ” IEEE Journal on Selected Topics in Signal Processing, vol. 1, no. 1, pp. 31–41, 2007.
33. N. Levanon and E. Mozeson, Radar Signals. Hoboken, NJ: John Wiley & Sons, 2004.
34. J. Li, J. R. Guerci, and L. Xu, “Signal waveform’s optimal-under-restriction design for active sensing, ” IEEE Signal Processing Letters, vol. 13, no. 9, pp. 565–8, 2006.
35. Z.-Q. Luo, N. D. Sidiropoulos, P. Tseng, and S. Zhang, “Approximation bounds for quadratic optimization with homogeneous quadratic constraints, ” SIAM Journal on Optimization, vol. 18, no. 1, pp. 1–28, 2007.
36. R. W. Miller and C. B. Chang, “A modified Cramér-Rao bound and its applications, ” IEEE Transactions on Information Theory, vol. 24, no. 3, pp. 398–400, 1978.
37. E. Mozeson and N. Levanon, “MATLAB code for plotting ambiguity functions, ” IEEE Transactions on Aerospace and Electronic Systems, vol. 38, no. 3, pp. 1064–8, July 2002.
38. H. Naparst, “Dense target signal processing, ” IEEE Transactions on Information Theory, vol. 37, no. 2, pp. 317–27, 1991.
39. A. Nemirovski, “Lectures on Modern Convex Optimization, ” Class Notes, Georgia Institute of Technology, Fall 2005.
40. A. Nemirovski, C. Roos, and T. Terlaky, “On maximization of quadratic form over intersection of ellipsoids with common center, ” Mathematical Programming, vol. 86, pp. 463–73, 1999.
41. S. U. Pillai, H. S. Oh, D. C. Youla, and J. R. Guerci, “Optimum transmit-receiver design in the presence of signal-dependent interference and channel noise, ” IEEE Transactions on Information Theory, vol. 46, no. 2, pp. 577–84, 2000.
42. I. Pólik and T. Terlaky, “S-lemma: a survey, ” SIAM Review, vol. 49, no. 3, pp. 371–418, 2007.
43. J. F. Sturm, “Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones, ” Optim. Meth. Software, vol. 11–12, pp. 625–53, 1999.
44. J. F. Sturm and S. Zhang, “On cones of nonnegative quadratic functions, ” Mathematics of Operations Research, vol. 28, pp. 246–67, 2003.
45. H. L. van Trees, Optimum Array Processing. Part IV of Detection, Estimation and Modulation Theory. New York: John Wiley & Sons, 2002.
46. C. H. Wilcox, “The synthesis problem for radar ambiguity functions, ” Math Resource Center, U. S. Army, University Wisconsin, Madison, WI, MRCTech. Summary Rep. 157, April 1960; reprinted in R. E. Blahut, W. M. Miller, and C. H. Wilcox, Radar and Sonar, Part 1. New York: Springer, 1991.
47. V. A. Yakubovich, “S-procedure in nonlinear control theory, ” Vestnik Leningrad University, vol. 4, no. 1, pp. 73–93, 1977. (In Russian 1971.)
48. Y. Ye and S. Zhang, “New results on quadratic optimization, ” SIAM Journal on Optimization, vol. 14, no. 1, pp. 245–67, 2003.