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

In this two-part paper, we propose a general algorithmic framework for the minimization of a nonconvex smooth function subject to nonconvex smooth constraints, and also consider extensions to some structured, nonsmooth problems. The algorithm solves a sequence of (separable) strongly convex problems...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on signal processing Jg. 65; H. 8; S. 1929 - 1944
Hauptverfasser:	Scutari, Gesualdo, Facchinei, Francisco, Lampariello, Lorenzo
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	IEEE 15.04.2017
Schlagworte:	Ad hoc networks Approximation algorithms Convergence Distributed algorithms Linear programming nonconvex optimization Optimization Signal processing algorithms successive convex approximation
ISSN:	1053-587X, 1941-0476
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!