Distributed nonconvex constrained optimization over time-varying digraphs

This paper considers nonconvex distributed constrained optimization over networks, modeled as directed (possibly time-varying) graphs. We introduce the first algorithmic framework for the minimization of the sum of a smooth nonconvex (nonseparable) function—the agent’s sum-utility—plus a difference-...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Mathematical programming Ročník 176; číslo 1-2; s. 497 - 544
Hlavní autori:	Scutari, Gesualdo, Sun, Ying
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.07.2019 Springer Nature B.V
Predmet:	Algorithms Calculus of Variations and Optimal Control; Optimization Combinatorics Convergence Economic models Engineering education Full Length Paper Graph theory Machine learning Mathematical and Computational Physics Mathematical Methods in Physics Mathematical models Mathematics Mathematics and Statistics Mathematics of Computing Nonlinear programming Numerical Analysis Optimization Theoretical 90C90 65K10 91A10 65K15 49M27 90C33
ISSN:	0025-5610, 1436-4646
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!