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

DOI10.1109/TSP.2016.2637314MaRDI QIDQ4620718zbMATH OpenOpenAlexFDO

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

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) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Nonconvex programming, global optimization (90C26)

Cited in

(10)

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

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

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