The Adaptive Projected Subgradient Method Constrained by Families of Quasi-nonexpansive Mappings and Its Application to Online Learning

DOI10.1137/100807004zbMath1266.47113arXiv1008.5231OpenAlexW2963338986MaRDI QIDQ5300520

Isao Yamada, Konstantinos Slavakis

Publication date: 27 June 2013

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1008.5231

zbMATH Keywords

adaptive filteringsubgradient methodonline learningsparsityquasi-nonexpansive mappingasymptotic minimization

Mathematics Subject Classification ID

Convex programming (90C25) Numerical optimization and variational techniques (65K10) Learning and adaptive systems in artificial intelligence (68T05) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Numerical solution to inverse problems in abstract spaces (65J22) Computer-assisted instruction, e-learning (aspects of mathematics education) (97U50)

Related Items (6)

Data-driven control of nonlinear systems: an on-line direct approach ⋮ The Method of Cyclic Intrepid Projections: Convergence Analysis and Numerical Experiments ⋮ Quasi-Nonexpansive Iterations on the Affine Hull of Orbits: From Mann's Mean Value Algorithm to Inertial Methods ⋮ Acoustic feedback cancellation based on weighted adaptive projection subgradient method in hearing aids ⋮ On Subgradient Projectors ⋮ On the finite convergence of a projected cutter method

Uses Software

• UNLocBoX

This page was built for publication: The Adaptive Projected Subgradient Method Constrained by Families of Quasi-nonexpansive Mappings and Its Application to Online Learning