Signal processing in dual domain by adaptive projected subgradient method

Masahiro Yukawa, Konstantinos Slavakis, Isao Yamada.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

The goal of this paper is to establish a novel signal processing paradigm that enables us to find a point meeting time-variable specifications in dual domain (e.g., time and frequency domains) simultaneously. For this purpose, we define a new problem which we call adaptive split feasibility problem (ASFP). In the ASFP formulation, we have (i) a priori knowledge based convex constraints in the Euclidean spaces RN and RM and (ii) data-dependent convex sets in RN and RM; the latter are obtained in a sequential fashion. Roughly speaking, the problem is to find a common point of all the sets defined on RN such that its image under a given linear transformation is a common point of all the sets defined on RM, if such a point exists. We prove that the adaptive projected subgradient method (APSM) deals with the ASFP by employing (i) a projected gradient operator with respect to (w.r.t.) a 'fixed' proximity function reflecting the convex constraints and (ii) a subgradient projection w.r.t. 'time-varying' objective functions reflecting the data-dependent sets. The resulting algorithm requires no unwanted operations such as matrix inversion, therefore it is suitable for realtime implementation. A convergence analysis is presented and verified by numerical examples.

Original languageEnglish (US)
Title of host publicationDSP 2009
Subtitle of host publication16th International Conference on Digital Signal Processing, Proceedings
DOIs
StatePublished - Nov 20 2009
EventDSP 2009:16th International Conference on Digital Signal Processing - Santorini, Greece
Duration: Jul 5 2009Jul 7 2009

Other

OtherDSP 2009:16th International Conference on Digital Signal Processing
CountryGreece
CitySantorini
Period7/5/097/7/09

Fingerprint

Signal processing
Linear transformations
Specifications

Keywords

  • Adaptive projected subgradient method
  • Convex feasibility problem
  • Projected gradient
  • Split feasibility problem

Cite this

Yukawa, M., Slavakis, K., & Yamada., I. (2009). Signal processing in dual domain by adaptive projected subgradient method. In DSP 2009: 16th International Conference on Digital Signal Processing, Proceedings [5201250] https://doi.org/10.1109/ICDSP.2009.5201250

Signal processing in dual domain by adaptive projected subgradient method. / Yukawa, Masahiro; Slavakis, Konstantinos; Yamada., Isao.

DSP 2009: 16th International Conference on Digital Signal Processing, Proceedings. 2009. 5201250.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yukawa, M, Slavakis, K & Yamada., I 2009, Signal processing in dual domain by adaptive projected subgradient method. in DSP 2009: 16th International Conference on Digital Signal Processing, Proceedings., 5201250, DSP 2009:16th International Conference on Digital Signal Processing, Santorini, Greece, 7/5/09. https://doi.org/10.1109/ICDSP.2009.5201250
Yukawa M, Slavakis K, Yamada. I. Signal processing in dual domain by adaptive projected subgradient method. In DSP 2009: 16th International Conference on Digital Signal Processing, Proceedings. 2009. 5201250 https://doi.org/10.1109/ICDSP.2009.5201250
Yukawa, Masahiro ; Slavakis, Konstantinos ; Yamada., Isao. / Signal processing in dual domain by adaptive projected subgradient method. DSP 2009: 16th International Conference on Digital Signal Processing, Proceedings. 2009.
@inproceedings{df442919a2e04bd3bc1d4a632ad61cdb,
title = "Signal processing in dual domain by adaptive projected subgradient method",
abstract = "The goal of this paper is to establish a novel signal processing paradigm that enables us to find a point meeting time-variable specifications in dual domain (e.g., time and frequency domains) simultaneously. For this purpose, we define a new problem which we call adaptive split feasibility problem (ASFP). In the ASFP formulation, we have (i) a priori knowledge based convex constraints in the Euclidean spaces RN and RM and (ii) data-dependent convex sets in RN and RM; the latter are obtained in a sequential fashion. Roughly speaking, the problem is to find a common point of all the sets defined on RN such that its image under a given linear transformation is a common point of all the sets defined on RM, if such a point exists. We prove that the adaptive projected subgradient method (APSM) deals with the ASFP by employing (i) a projected gradient operator with respect to (w.r.t.) a 'fixed' proximity function reflecting the convex constraints and (ii) a subgradient projection w.r.t. 'time-varying' objective functions reflecting the data-dependent sets. The resulting algorithm requires no unwanted operations such as matrix inversion, therefore it is suitable for realtime implementation. A convergence analysis is presented and verified by numerical examples.",
keywords = "Adaptive projected subgradient method, Convex feasibility problem, Projected gradient, Split feasibility problem",
author = "Masahiro Yukawa and Konstantinos Slavakis and Isao Yamada.",
year = "2009",
month = "11",
day = "20",
doi = "10.1109/ICDSP.2009.5201250",
language = "English (US)",
isbn = "9781424432981",
booktitle = "DSP 2009",

}

TY - GEN

T1 - Signal processing in dual domain by adaptive projected subgradient method

AU - Yukawa, Masahiro

AU - Slavakis, Konstantinos

AU - Yamada., Isao

PY - 2009/11/20

Y1 - 2009/11/20

N2 - The goal of this paper is to establish a novel signal processing paradigm that enables us to find a point meeting time-variable specifications in dual domain (e.g., time and frequency domains) simultaneously. For this purpose, we define a new problem which we call adaptive split feasibility problem (ASFP). In the ASFP formulation, we have (i) a priori knowledge based convex constraints in the Euclidean spaces RN and RM and (ii) data-dependent convex sets in RN and RM; the latter are obtained in a sequential fashion. Roughly speaking, the problem is to find a common point of all the sets defined on RN such that its image under a given linear transformation is a common point of all the sets defined on RM, if such a point exists. We prove that the adaptive projected subgradient method (APSM) deals with the ASFP by employing (i) a projected gradient operator with respect to (w.r.t.) a 'fixed' proximity function reflecting the convex constraints and (ii) a subgradient projection w.r.t. 'time-varying' objective functions reflecting the data-dependent sets. The resulting algorithm requires no unwanted operations such as matrix inversion, therefore it is suitable for realtime implementation. A convergence analysis is presented and verified by numerical examples.

AB - The goal of this paper is to establish a novel signal processing paradigm that enables us to find a point meeting time-variable specifications in dual domain (e.g., time and frequency domains) simultaneously. For this purpose, we define a new problem which we call adaptive split feasibility problem (ASFP). In the ASFP formulation, we have (i) a priori knowledge based convex constraints in the Euclidean spaces RN and RM and (ii) data-dependent convex sets in RN and RM; the latter are obtained in a sequential fashion. Roughly speaking, the problem is to find a common point of all the sets defined on RN such that its image under a given linear transformation is a common point of all the sets defined on RM, if such a point exists. We prove that the adaptive projected subgradient method (APSM) deals with the ASFP by employing (i) a projected gradient operator with respect to (w.r.t.) a 'fixed' proximity function reflecting the convex constraints and (ii) a subgradient projection w.r.t. 'time-varying' objective functions reflecting the data-dependent sets. The resulting algorithm requires no unwanted operations such as matrix inversion, therefore it is suitable for realtime implementation. A convergence analysis is presented and verified by numerical examples.

KW - Adaptive projected subgradient method

KW - Convex feasibility problem

KW - Projected gradient

KW - Split feasibility problem

UR - http://www.scopus.com/inward/record.url?scp=70449553188&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70449553188&partnerID=8YFLogxK

U2 - 10.1109/ICDSP.2009.5201250

DO - 10.1109/ICDSP.2009.5201250

M3 - Conference contribution

SN - 9781424432981

BT - DSP 2009

ER -