Online Distributed Optimization With Strongly Pseudoconvex-Sum Cost Functions
From MaRDI portal
Publication:5211352
DOI10.1109/TAC.2019.2915745zbMath1483.90119WikidataQ127896649 ScholiaQ127896649MaRDI QIDQ5211352
Gangshan Jing, Kaihong Lu, Long Wang
Publication date: 28 January 2020
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Nonconvex programming, global optimization (90C26) Deterministic network models in operations research (90B10) Online algorithms; streaming algorithms (68W27)
Related Items (4)
A gradient‐free distributed optimization method for convex sum of nonconvex cost functions ⋮ Online distributed optimization with strongly pseudoconvex-sum cost functions and coupled inequality constraints ⋮ Distributed online convex optimization with multiple coupled constraints: a double accelerated push-pull algorithm ⋮ Continuous-time distributed optimization with strictly pseudoconvex objective functions
This page was built for publication: Online Distributed Optimization With Strongly Pseudoconvex-Sum Cost Functions
