Robust wideband beamforming by the hybrid steepest descent method

IEEE Transactions on Signal Processing

Volumn 55, Issue 9, 2007, Pages 4511-4522

  Slavakis, Konstantinos ^a   Yamada, Isao ^b  

^a UNIVERSITY OF ATHENS   (Greece)

^b Tokyo Institute of Technology ^*  (Japan)

Author keywords

Convex feasibility problems; Fixed point theory; Hybrid steepest descent method; Wideband beamforming

Indexed keywords

COST FUNCTIONS; SET THEORY; SMART ANTENNAS;

CONVEX FEASIBILITY PROBLEMS; FIXED POINT THEORY; HYBRID STEEPEST DESCENT METHOD; WIDEBAND BEAMFORMING;

BEAMFORMING;

EID: 34548252441     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2007.896252     Document Type: Article

References (41)

1. L. C. Godara, Smart Antennas. Boca Raton, FL: CRC, 2004.
2. H. L. Van Trees, Optimum Array Processing: Part IV of Detection, Estimation, and Modulation Theory. New York: Wiley, 2002.
3. C. A. Balanis, Antenna Theory: Analysis and Design. New York: Wiley, 1997.
4. M. Ghavami, "Wideband smart antenna theory using rectangular array structures," IEEE Trans. Signal Process., vol. 50, no. 9, pp. 2143-2151, Sep. 2002.
5. D. M. Pozar, "Microstrip antennas," Proc. IEEE, vol. 80, no. 1, pp. 79-91, Jan. 1992.
6. J. Gu, H. Stark, and Y. Yang, "Wide-band smart antenna design using vector space projection methods," IEEE Trans. Antennas Propag., vol. 52, no. 12, pp. 3228-3236, Dec. 2004.
7. H. Lebret and S. Boyd, "Antenna array pattern synthesis via convex optimization," IEEE Trans. Signal Process., vol. 45, no. 3, pp. 526-532, Mar. 1997.
8. S. A. Vorobyov, A. B. Gershman, and Z.-Q. Luo, "Robust adaptive beamforming using worst-case performance optimization: A solution to the signal mismatch problem," IEEE Trans. Signal Process., vol. 51, no. 2, pp. 313-324, Feb. 2003.
9. J. Li, P. Stoica, and Z. Wang, "On robust Capon beamforming and diagonal loading," IEEE Trans. Signal Process., vol. 51, no. 7, pp. 1702-1715, Jul. 2003.
10. R. G. Lorenz and S. P. Boyd, "Robust minimum variance beam-forming," IEEE Trans. Signal Process., vol. 53, no. 5, pp. 1684-1696, May 2005.
11. K. Slavakis, M. Yukawa, and I. Yamada, "Robust Capon beamforming by the adaptive projected subgradient method," in Proc. IEEE Int. Conf. Acoustics, Speech, Signal Processing (ICASSP), 2006, pp. 1005-1008.
12. H. Stark and Y. Yang, Vector Space Projections: A Numerical Approach to Signal and Image Processing, Neural Nets, and Optics. New York: Wiley, 1998.
13. O. M. Bucci, G. D. Elia, and G. Romita, "Power synthesis of conformal arrays by a generalized projection method," in Proc. Inst. Elect. Eng. - Microwave Antennas Propagat., 1995, vol. 142, pp. 467-471.
14. L. M. Bregman, "The method of successive projections for finding a common point of convex sets," Soviet Math. Dokl., vol. 6, pp. 688-692, 1965.
15. L. G. Gubin, B. T. Polyak, and E. V. Raik, "The method of projections for finding the common point of convex sets," USSR Comput. Math. Phys., vol. 7, pp. 1-24, 1967.
16. P. L. Combettes, "The foundations of set theoretic estimation," Proc. IEEE, vol. 81, no. 2, pp. 182-208, 1993.
17. H. H. Bauschke and J. M. Borwein, "On projection algorithms for solving convex feasibility problems," SIAM Rev., vol. 38, no. 3, pp. 367-426, Sep. 1996.
18. F. Deutsch, Best Approximation in Inner Product Spaces. New York: Springer-Verlag, 2001.
19. S. Shahbazpanahi, A. B. Gershman, Z.-Q. Luo, and K. M. Wong, "Robust adaptive beamforming for general-rank signal models," IEEE Trans. Signal Process., vol. 51, no. 9, pp. 2257-2269, Sep. 2003.
20. Y. Nesterov and A. Nemirovsky, Interior-Point Polynomial Methods in Convex Programming, ser. Studies in Applied Mathematics. Philadelphia, PA: SIAM, 1994, vol. 13.
21. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004.
22. M. S. Lobo, L. Vandenberghe, S. Boyd, and H. Lebret, "Applications of second-order cone programming," Linear Algebra Appl., vol. 284, no. 1-3, pp. 193-228, Nov. 1998.
23. J. F. Sturm, "Using SeDuMi 1.02, A MATLAB toolbox for optimization over symmetric cones," Optim. Meth. Softw., vol. 11-12, pp. 625-653, Aug. 1999.
24. Z.-Q. Luo and W. Yu, "An introduction to convex optimization for communications and signal processing," IEEE J. Sel. Areas Commun. vol. 24, no. 8, pp. 1426-1438, Aug. 2006.
25. K. Goebel and S. Reich, Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings, ser. Pure and Applied Math. New York: Marcel Dekker, 1984, vol. 83.
26. I. Yamada, "The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings," in Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications, D. Butnariu, Y. Censor, and S. Reich, Eds. Amsterdam, The Netherlands: Elsevier, 2001, pp. 473-504.
27. I. Yamada and N. Ogura, "Hybrid steepest descent method for variational inequality problem over the fixed point set of certain quasi-non-expansive mappings," Numer. Funct. Anal. Optim., vol. 25, no. 7&8, pp. 619-655, 2004.
28. E. Kreyszig, Introductory Functional Analysis with Applications, ser. Wiley Classics Library. New York: Wiley, 1989.
29. H. H. Bauschke, "Projection algorithms and monotone operators," Ph.D. dissertation, Math. and Statist. Dept., Simon Fraser University, Burnaby, BC, Canada, 1996.
30. H. S. Hundal, "An alternating projection that does not converge in norm," Nonlin. Anal., vol. 57, pp. 35-61, 2004.
31. D. G. Manolakis, V. K. Ingle, and S. M. Kogon, Statistical and Adaptive Signal Processing: Spectral Estimation, Signal Modeling, Adaptive Filtering and Array Processing. Boston, MA: McGraw-Hill, 2000.
32. B. Porat, Digital Processing of Random Signals: Theory and Methods Englewood Cliffs, NJ: Prentice-Hall, 1994.
33. N. K. Bose, Digital Filters: Theory and Applications. Malabar, FL: Krieger, 1993.
34. K. Fujisawa, M. Kojima, and K. Nakata, "SDPA (Semidefinite Programming Algorithm) - User's manual," Dept. Mathematical and Computing Sciences, Tokyo Institute of Technology, Tech. Rep. B-308, Dec. 1995 [Online]. Available: Ftp://ftp.is.titech.ac.jp/pub/OpRes/software/SDPA
35. K. Fujisawa, M. Fukuda, M. Kojima, and K. Nakata, "Numerical evaluation of SDPA (semidefinite programming algorithm)," in High Performance Optimization. Norwell, MA: Kluwer, 2000, ch. 11, pp. 267-301.
36. K. Slavakis, M. Yukawa, and I. Yamada, "Efficient robust adaptive beamforming by the adaptive projected subgradient method: A set theoretic time-varying approach over multiple a-priori constraints," Tech. Rep. SIP2005-52, Jul. 2005, IEICE, WBS2005-10, 2005-07.
37. K. Slavakis, I. Yamada, and N. Ogura, "The adaptive projected subgradient method over the fixed point set of strongly attracting nonexpansive mappings," Numer. Funct. Anal. Optim., vol. 27, no. 7&8, pp. 905-930, 2006.
38. I. Yamada, N. Ogura, Y. Yamashita, and K. Sakaniwa, "Quadratic optimization of fixed points of nonexpansive mappings in Hilbert space," Numer. Funct. Anal. Optim., vol. 19, pp. 165-190, 1998.
39. P. L. Combettes and P. Bondon, "Hard-constrained inconsistent signal feasibility problem," IEEE Trans. Signal Process., vol. 47, no. 9, pp. 2460-2468, Sep. 1999.
40. H. K. Xu and T. H. Kim, "Convergence of hybrid steepest descent methods for variational inequalities," J. Optim. Theory Appl., vol. 119, no. 1, pp. 185-201, 2003.
41. M. S. Bazaraa, H. D. Sherali, and C. M. Shetty, Nonlinear Programming: Theory and Algorithms. New York: Wiley, 1993.