Parallel and Distributed Methods for Constrained Nonconvex Optimization-Part II: Applications in Communications and Machine Learning

DOI10.1109/TSP.2016.2637314zbMath1414.90291OpenAlexW2560549724MaRDI QIDQ4620718

Gesualdo Scutari, Peiran Song, Stefania Sardellitti, Lorenzo Lampariello, Francisco Facchinei

Publication date: 8 February 2019

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

Full work available at URL: https://doi.org/10.1109/tsp.2016.2637314

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (9)

Distributed algorithms for convex problems with linear coupling constraints ⋮ Combining approximation and exact penalty in hierarchical programming ⋮ Numerically tractable optimistic bilevel problems ⋮ A one-layer recurrent neural network for nonsmooth pseudoconvex optimization with quasiconvex inequality and affine equality constraints ⋮ Open issues and recent advances in DC programming and DCA ⋮ Asynchronous parallel algorithms for nonconvex optimization ⋮ DC programming and DCA: thirty years of developments ⋮ Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training ⋮ Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity

This page was built for publication: Parallel and Distributed Methods for Constrained Nonconvex Optimization-Part II: Applications in Communications and Machine Learning