Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity.
Kaja GruntkowskaAlexander TyurinPeter RichtárikPublished in: CoRR (2024)
Keyphrases
- worst case
- global optimization
- communication overhead
- optimization problems
- communication cost
- space complexity
- computer networks
- distributed control
- upper bound
- nonlinear programming
- average case
- similarity measure
- similarity function
- multi agent
- lower bound
- fault tolerant
- constrained optimization
- information dissemination
- distributed network
- cooperative
- open systems
- spatially distributed
- multi party
- single point of failure
- communication systems
- penalty function
- distributed computation
- fully distributed
- objective function
- convex optimization
- computational complexity
- np hard
- distance measure
- optimization algorithm
- error bounds
- semantic similarity
- approximation algorithms
- global convergence
- combinatorial optimization
- mobile agents
- greedy algorithm
- multimedia communication
- stationary points
- particle swarm optimization
- convex functions
- peer to peer
- distributed systems
- image restoration and reconstruction