Adaptive projected subgradient method and set theoretic adaptive filtering with multiple convex constraints

Konstantinos Slavakis, Isao Yamada, Nobuhiko Ogura, Masahiro Yukawa

Research output: Contribution to journalConference article

5 Citations (Scopus)

Abstract

This paper presents an algorithmic solution, the Adaptive Projected Subgradient Method, to the problem of asymptotically minimizing a certain sequence of nonnegative continuous convex functions over the fixed point set of strongly attracting nonexpansive mappings in a real Hilbert space. The proposed method provides with a strongly convergent, asymptotically optimal point sequence as well as with a characterization of the limiting point. As a side effect, the method allows the asymptotic minimization over the nonempty intersection of a finite number of closed convex sets. Thus, new directions for set theoretic adaptive filtering algorithms are revealed whenever the estimandum (system to be identified) is known to satisfy a number of convex constraints. This leads to a unification of a wide range of set theoretic adaptive filtering schemes such as NLMS, Projected or Constrained NLMS, APA, Adaptive Parallel Subgradient Projection Algorithm, Adaptive Parallel Min-Max Projection Algorithm as well as their embedded constraint versions. Numerical results demonstrate the effectiveness of the proposed method to the problem of stereophonic acoustic echo cancellation.

Original languageEnglish
Pages (from-to)960-964
Number of pages5
JournalConference Record - Asilomar Conference on Signals, Systems and Computers
Volume1
Publication statusPublished - 2004 Dec 1
Externally publishedYes
EventConference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers - Pacific Grove, CA, United States
Duration: 2004 Nov 72004 Nov 10

ASJC Scopus subject areas

  • Signal Processing
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Adaptive projected subgradient method and set theoretic adaptive filtering with multiple convex constraints'. Together they form a unique fingerprint.

  • Cite this