Randomized Algorithms for Distributed Nonlinear Optimization Under Sparsity Constraints

DOI10.1109/TSP.2015.2500887zbMATH Open1412.94077MaRDI QIDQ4618249FDOQ4618249

Authors: Chiara Ravazzi, Sophie M. Fosson, Enrico Magli 

Publication date: 7 February 2019

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

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited In (8)

• Distributed stochastic nonsmooth nonconvex optimization
• Discrete time-variant nonlinear optimization and system solving via integral-type error function and twice ZND formula with noises suppressed
• Spectral distributed Lagrange multiplier method: algorithm and benchmark tests
• Non-Convex Distributed Optimization
• Zeroth-order algorithms for stochastic distributed nonconvex optimization
• Distributed Design for Nuclear Norm Minimization of Linear Matrix Equations With Constraints
• A class of randomized primal-dual algorithms for distributed optimization
• Random block coordinate descent methods for linearly constrained optimization over networks

This page was built for publication: Randomized Algorithms for Distributed Nonlinear Optimization Under Sparsity Constraints

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