An Adaptive Projected Subgradient Approach to Learning in Diffusion Networks

DOI10.1109/TSP.2009.2018648MaRDI QIDQ4569761zbMATH OpenWikidataFDO

Authors R. L. G. Cavalcante, Isao Yamada, B. Mulgrew

Publication date 9 July 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Methods of reduced gradient type (90C52)

Cited in

(9)

• An adaptive online learning algorithm for distributed convex optimization with coupled constraints over unbalanced directed graphs
• Primal-dual stochastic distributed algorithm for constrained convex optimization
• Distributed constrained stochastic subgradient algorithms based on random projection and asynchronous broadcast over networks
• A unified view of adaptive variable-metric projection algorithms
• Minimizing the Moreau envelope of nonsmooth convex functions over the fixed point set of certain quasi-nonexpansive mappings
• Distributed Newton methods for strictly convex consensus optimization problems in multi-agent networks
• Distributed stochastic subgradient projection algorithms based on weight-balancing over time-varying directed graphs
• Sparsity promoting decentralized learning strategies for radio tomographic imaging using consensus based ADMM approach
• Adaptation and learning over networks under subspace constraints Part II: Performance Analysis

This page was built for publication: An Adaptive Projected Subgradient Approach to Learning in Diffusion Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4569761)