Sliding window generalized kernel affine projection algorithm using projection mappings
From MaRDI portal
Recommendations
- Kernel affine projection algorithms
- Parsimonious online learning with kernels via sparse projections in function space
- Kernel least mean square algorithm with constrained growth
- scientific article; zbMATH DE number 1931826
- The adaptive projected subgradient method constrained by families of quasi-nonexpansive mappings and its application to online learning
Cites work
- Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions
- Constrained adaptation algorithms employing Householder transformation
- Low-complexity constrained affine-projection algorithms
- On Projection Algorithms for Solving Convex Feasibility Problems
- Online Learning with Kernels
- Pairwise Optimal Weight Realization—Acceleration Technique for Set-Theoretic Adaptive Parallel Subgradient Projection Algorithm
- The Adaptive Projected Subgradient Method over the Fixed Point Set of Strongly Attracting Nonexpansive Mappings
- The Kernel Recursive Least-Squares Algorithm
- Theory of Reproducing Kernels
- Weighted least squares support vector machines: robustness and sparse approximation
Cited in
(3)
This page was built for publication: Sliding window generalized kernel affine projection algorithm using projection mappings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q966856)