Pairwise Optimal Weight Realization—Acceleration Technique for Set-Theoretic Adaptive Parallel Subgradient Projection Algorithm
From MaRDI portal
Publication:4588053
DOI10.1109/TSP.2006.881225zbMath1374.94641OpenAlexW2129799762MaRDI QIDQ4588053
Publication date: 30 October 2017
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tsp.2006.881225
Related Items (5)
Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings ⋮ On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints ⋮ Sliding window generalized kernel affine projection algorithm using projection mappings ⋮ A unified view of adaptive variable-metric projection algorithms ⋮ Set-theoretic adaptive filtering based on data-driven sparsification
This page was built for publication: Pairwise Optimal Weight Realization—Acceleration Technique for Set-Theoretic Adaptive Parallel Subgradient Projection Algorithm