Multi-domain adaptive learning based on feasibility splitting and adaptive projected subgradient method

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E93-A, Issue 2, 2010, Pages 456-466

  Yukawa, Masahiro ^a   Slavakis, Konstantinos ^b   Yamada, Isao ^c  

^a RIKEN BRAIN SCIENCE INSTITUTE   (Japan)

^b UNIVERSITY OF PELOPONNESE   (Greece)

^c TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Adaptive algorithm; Convex feasibility problem; Convex projection; Projected gradient method

Indexed keywords

ADAPTIVE ALGORITHMS; GRADIENT METHODS; NUMERICAL METHODS; REAL TIME CONTROL; SET THEORY;

ADAPTIVE PROJECTED SUBGRADIENT METHODS; CONVERGENCE ANALYSIS; CONVEX FEASIBILITY PROBLEM; CONVEX PROJECTIONS; OBJECTIVE FUNCTIONS; PROJECTED GRADIENT METHODS; REAL-TIME IMPLEMENTATIONS; SUBGRADIENT PROJECTIONS;

SPECIFICATIONS;

EID: 77950789961     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1587/transfun.E93.A.456     Document Type: Article

References (44)

1. Y. Censor and T. Elfving, " A multiprojection algorithm using Bregman projections in a product space, " Numerical Algorithms, vol. 8, no. 2, pp. 221-239, 1994.
2. C. Byrne, " Bregman-Legendre multidistance projection algorithms for convex feasibility and optimization, " in Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications, pp. 87-100, Elsevier, Amsterdam, 2001.
3. C. Byrne, " Iterative oblique projection onto convex sets and the split feasibility problem, " Inverse Problems, vol. 18, pp. 441-453, 2002. (Pubitemid 34428529)
4. Y. Censor, T. Elfving, N. Kopf, and T. Bortfeld, " The multiple-sets split feasibility problem and its applications for inverse problems, " Inverse Problems, vol. 21, pp. 2071-2084, 2005. (Pubitemid 41744516)
5. A. Cauchy, " Méthode générale pour la réolution des systèmes d'équations simultanées, " C. R. Acad. Sci. Paris, vol. 25, pp. 536-538, 1847.
6. J. von Neumann, " Functional operators, " in The Geometry of Orthogonal Spaces, Annals of Math. Studies, 22, vol. II, Princeton Univ. Press, Princeton, 1950. Reprint of mimeographed lecture notes first distributed in 1933.
7. S. Kaczmarz, " Angenäherte auflösung von systemen linearer gleichungen, " Bull. Int. Acad. Sci. Pologne, vol. A35, pp. 355-357, 1937.
8. G. Cimmino, " Cacolo approssimato per le soluzioni dei systemi di equazioni lineari, " La Ricerca Scientifica (Roma), vol. 1, pp. 326-333, 1938.
9. W. Cheney and A. Goldstein, " Proximity maps for convex sets, " Proc. Am. Math. Soc., vol. 10, pp. 448-450, 1959.
10. 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.
11. 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.
12. H. H. Bauschke and J. M. Borwein, " On projection algorithms for solving convex feasibility problems, " SIAM Review, vol. 38, no. 3, pp. 367-426, 1996.
13. Y. Censor and S. A. Zenios, Parallel Optimization: Theory, Algorithm, and Optimization, Oxford University Press, 1997.
14. H. Stark and Y. Yang, Vector Space Projections - A Numerical Approach to Signal and Image Processing, Neural Nets, and Optics, John Wiley & Sons, New York, 1998.
15. F. Deutsch, Best Approximation in Inner Product Spaces, Springer, 2001.
16. H. H. Bauschke, P. L. Combettes, and S. G. Kruk, " Extrapolation algorithm for affine-convex feasibility problems, " Numerical Algorithms, vol. 41, pp. 239-274, 2006.
17. P. L. Combettes, " The foundations of set theoretic estimation, " Proc. IEEE, vol. 81, no. 2, pp. 182-208, Feb. 1993.
18. I. Yamada, K. Slavakis, and K. Yamada, " An efficient robust adaptive filtering algorithm based on parallel subgradient projection techniques, " IEEE Trans. Signal Process., vol. 50, no. 5, pp. 1091-1101, May 2002.
19. I. Yamada, " Adaptive projected subgradient method: A unified view for projection based adaptive algorithms, " J. IEICE, vol. 86, no. 8, pp. 654-658, Aug. 2003.
20. I. Yamada and N. Ogura, " Adaptive projected subgradient method for asymptotic minimization of sequence of nonnegative convex functions, " Numer. Funct. Anal. Optim., vol. 25, no. 7&8, pp. 593-617, 2004.
21. K. Slavakis, I. Yamada, and N. Ogura, " 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.
22. M. Yukawa, R. L. G. Cavalcante, and I. Yamada, " Efficient blind MAI suppression in DS/CDMA systems by embedded constraint parallel projection techniques, " IEICE Trans. Fundamentals, vol. E88-A, no. 8, pp. 2062-2071 Aug. 2005. (Pubitemid 41409032)
23. M. Yukawa, N. Murakoshi, and I. Yamada, " Efficient fast stereo acoustic echo cancellation based on pairwise optimal weight realization technique, " EURASIP J. Appl. Signal Processing, vol. 2006, Article ID 84797, pp. 1-15, 2006.
24. M. Yukawa, K. Slavakis, and I. Yamada, " Adaptive parallel quadratic-metric projection algorithms, " IEEE Trans. Audio Speech Language Process., vol. 15, no. 5, pp. 1665-1680, July 2007.
25. R. L. G. Cavalcante and I. Yamada, " Multiaccess interference suppression in orthogonal space-time block coded MIMO systems by adaptive projected subgradient method, " IEEE Trans. Signal Process., vol. 56, no. 3, pp. 1028-1042, March 2008.
26. K. Slavakis, S. Theodoridis, and I. Yamada, " Online kernelbased classification using adaptive projection algorithms, " IEEE Trans. Signal Process., vol. 56, no. 7, Part 1, pp. 2781-2796, July 2008.
27. K. Slavakis, S. Theodoridis, and I. Yamada, " Adaptive constrained learning in reproducing kernel Hilbert spaces: The robust beamforming case, " IEEE Trans. Signal Process., vol. 57, no. 12, pp. 4744-4764, Dec. 2009.
28. R. L. G. Cavalcante and I. Yamada, " A flexible peak-to-average power ratio reduction scheme for OFDM systems by the adaptive projected subgradient method, " IEEE Trans. Signal Process., vol. 57, no. 4, pp. 1456-1468, April 2009.
29. R. L. G. Cavalcante, I. Yamada, and B. Mulgrew, " An adaptive projected subgradient approach to learning in diffusion networks, " IEEE Trans. Signal Process., vol. 57, no. 7, pp. 2762-2774, July 2009.
30. Y. Censor, A. Motova, and A. Segal, " Perturbed projections and subgradient projections for the multiple-sets split feasibility problem, " J. Mathematical Analysis and Applications, vol. 327, no. 2, pp. 1244-1256, March 2007.
31. M. Yukawa, K. Slavakis, and I. Yamada, " Signal processing in dual domain by adaptive projected subgradient method, " IEEE Int. Conf. Digital Signal Processing, pp. 1-6, July 2009.
32. R. W. Gerchberg, " Super-resolution through error energy reduction, " J. Modern Optics, vol. 21, no. 9, pp. 709-720, Sept. 1974.
33. A. Papoulis, " A new algorithm in spectral analysis and bandlimited extrapolation, " IEEE Trans. Circuits Syst., vol. CAS-22, no. 9, pp. 735-742, Sept. 1975.
34. D. P. Mandic and I. Yamada, " Machine learning and signal processing applications of fixed point theory, " Tutorial in IEEE ICASSP, 2007.
35. M. Yukawa and I. Yamada, " Pairwise optimal weight realization - Acceleration technique for set-theoretic adaptive parallel subgradient projection algorithm, " IEEE Trans. Signal Process., vol. 54, no. 12, pp. 4557-4571, Dec. 2006.
36. R. L. G. Cavalcante, M. Yukawa, and I. Yamada, " Set-theoretic DS/CDMA receivers for fading channels by adaptive projected subgradient method, " Proc. IEEE GLOBECOM, SP06-1, 2005.
37. M. Yukawa and I. Yamada, " Adaptive beamforming by constrained parallel projection in the presence of spatially-correlated interferences, " Proc. IEEE ICASSP, pp. 1009-1012, 2006.
38. J. C. Dunn, " Convexity, monotonicity, and gradient processes, " J. Math. Anal. Appl., vol. 53, pp. 145-158, 1976.
39. J. B. Baillon and G. Haddad, " Quelques propriétés des opérateurs angle-bornés et n-cycliquement monotones, " Israel J. Math., vol. 22, pp. 137-150, 1977.
40. C. Byrne, " A unified treatment of some iterative algorithms in signal processing and image reconstruction, " Inverse Problems, vol. 20, pp. 103-120, 2004.
41. N. Ogura and I. Yamada, " Non-strictly convex minimization over the fixed point set of an asymptotically shrinking nonexpansive mapping, " Numer. Funct. Anal. Optim., vol. 23, no. 1&2, pp. 113-137, 2002.
42. I. Yamada, N. Ogura, and N. Shirakawa, " A numerically robust hybrid steepest descent method for the convexly constrained generalized inverse problems, " Contemporary Mathematics, vol. 313, pp. 269-305, 2002.
43. I. Yamada and N. Ogura, " Hybrid steepest descent method for variational inequality problem over the fixed point set of certain quasi-nonexpansive mappings, " Numer. Funct. Anal. Optim., vol. 25, no. 7&8, pp. 619-655, 2004.
44. E. Kreyszig, Introductory Functional Analysis with Applications, Wiley, New York, 1989.