Parallel and Distributed Methods for Constrained Nonconvex Optimization—Part I: Theory

DOI10.1109/TSP.2016.2637317zbMath1414.90290arXiv1601.04059OpenAlexW2295566694MaRDI QIDQ4620717

Lorenzo Lampariello, Francisco Facchinei, Gesualdo Scutari

Publication date: 8 February 2019

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

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

Mathematics Subject Classification ID

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

Related Items (13)

Fast and stable nonconvex constrained distributed optimization: the ELLADA algorithm ⋮ Distributed Optimization Based on Gradient Tracking Revisited: Enhancing Convergence Rate via Surrogation ⋮ Distributed algorithms for convex problems with linear coupling constraints ⋮ Combining approximation and exact penalty in hierarchical programming ⋮ Numerically tractable optimistic bilevel problems ⋮ Distributed nonconvex constrained optimization over time-varying digraphs ⋮ Distributed optimization methods for nonconvex problems with inequality constraints over time-varying networks ⋮ Decentralized optimization with affine constraints over time-varying networks ⋮ Open issues and recent advances in DC programming and DCA ⋮ Asynchronous parallel algorithms for nonconvex optimization ⋮ DC programming and DCA: thirty years of developments ⋮ Is a finite intersection of balls covered by a finite union of balls in Euclidean spaces? ⋮ 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 I: Theory